./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.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 0bf79c30a8b941af2e2e52ff71757957757c98e5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0bf79c30a8b941af2e2e52ff71757957757c98e5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 15:59:53,224 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 15:59:53,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 15:59:53,238 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 15:59:53,238 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 15:59:53,239 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 15:59:53,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 15:59:53,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 15:59:53,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 15:59:53,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 15:59:53,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 15:59:53,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 15:59:53,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 15:59:53,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 15:59:53,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 15:59:53,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 15:59:53,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 15:59:53,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 15:59:53,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 15:59:53,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 15:59:53,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 15:59:53,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 15:59:53,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 15:59:53,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 15:59:53,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 15:59:53,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 15:59:53,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 15:59:53,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 15:59:53,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 15:59:53,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 15:59:53,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 15:59:53,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 15:59:53,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 15:59:53,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 15:59:53,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 15:59:53,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 15:59:53,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 15:59:53,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 15:59:53,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 15:59:53,312 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 15:59:53,312 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 15:59:53,312 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 15:59:53,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 15:59:53,312 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 15:59:53,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 15:59:53,315 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 15:59:53,315 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 15:59:53,315 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 15:59:53,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 15:59:53,316 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 15:59:53,316 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 15:59:53,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 15:59:53,316 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 15:59:53,317 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 15:59:53,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 15:59:53,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 15:59:53,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 15:59:53,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 15:59:53,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:59:53,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 15:59:53,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 15:59:53,321 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 15:59:53,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 15:59:53,321 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 15:59:53,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 15:59:53,321 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 -> 0bf79c30a8b941af2e2e52ff71757957757c98e5 [2018-12-30 15:59:53,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 15:59:53,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 15:59:53,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 15:59:53,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 15:59:53,400 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 15:59:53,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 15:59:53,481 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c580645d/7f0bd44d32014537a95cd35008876839/FLAGbbd2079d8 [2018-12-30 15:59:53,913 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 15:59:53,914 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 15:59:53,930 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c580645d/7f0bd44d32014537a95cd35008876839/FLAGbbd2079d8 [2018-12-30 15:59:54,268 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c580645d/7f0bd44d32014537a95cd35008876839 [2018-12-30 15:59:54,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 15:59:54,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 15:59:54,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 15:59:54,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 15:59:54,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 15:59:54,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2151cd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54, skipping insertion in model container [2018-12-30 15:59:54,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 15:59:54,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 15:59:54,559 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:59:54,564 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 15:59:54,624 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 15:59:54,640 INFO L195 MainTranslator]: Completed translation [2018-12-30 15:59:54,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54 WrapperNode [2018-12-30 15:59:54,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 15:59:54,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 15:59:54,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 15:59:54,650 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 15:59:54,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 15:59:54,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 15:59:54,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 15:59:54,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 15:59:54,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... [2018-12-30 15:59:54,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 15:59:54,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 15:59:54,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 15:59:54,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 15:59:54,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 15:59:54,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 15:59:54,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 15:59:55,002 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 15:59:55,002 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 15:59:56,047 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 15:59:56,047 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 15:59:56,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:59:56 BoogieIcfgContainer [2018-12-30 15:59:56,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 15:59:56,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 15:59:56,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 15:59:56,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 15:59:56,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 03:59:54" (1/3) ... [2018-12-30 15:59:56,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a49b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:59:56, skipping insertion in model container [2018-12-30 15:59:56,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 03:59:54" (2/3) ... [2018-12-30 15:59:56,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a49b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 03:59:56, skipping insertion in model container [2018-12-30 15:59:56,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:59:56" (3/3) ... [2018-12-30 15:59:56,055 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 15:59:56,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 15:59:56,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 15:59:56,088 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 15:59:56,122 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 15:59:56,123 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 15:59:56,123 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 15:59:56,123 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 15:59:56,124 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 15:59:56,124 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 15:59:56,124 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 15:59:56,124 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 15:59:56,124 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 15:59:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-12-30 15:59:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 15:59:56,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:59:56,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:59:56,157 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:59:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:59:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2018-12-30 15:59:56,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:59:56,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:59:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:59:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:59:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:59:56,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:59:56,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 15:59:56,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:59:56,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:59:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:56,419 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2018-12-30 15:59:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:59:56,810 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2018-12-30 15:59:56,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:59:56,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 15:59:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:59:56,827 INFO L225 Difference]: With dead ends: 245 [2018-12-30 15:59:56,828 INFO L226 Difference]: Without dead ends: 111 [2018-12-30 15:59:56,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-30 15:59:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-30 15:59:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-30 15:59:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2018-12-30 15:59:56,884 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2018-12-30 15:59:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:59:56,884 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2018-12-30 15:59:56,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:59:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2018-12-30 15:59:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 15:59:56,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:59:56,886 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:59:56,887 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:59:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:59:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2018-12-30 15:59:56,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:59:56,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:59:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:56,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:59:56,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:59:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 15:59:57,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:59:57,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:59:57,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:59:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:59:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:57,043 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2018-12-30 15:59:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:59:57,792 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2018-12-30 15:59:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:59:57,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-30 15:59:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:59:57,798 INFO L225 Difference]: With dead ends: 232 [2018-12-30 15:59:57,798 INFO L226 Difference]: Without dead ends: 130 [2018-12-30 15:59:57,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-30 15:59:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-30 15:59:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-30 15:59:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2018-12-30 15:59:57,825 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2018-12-30 15:59:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:59:57,825 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2018-12-30 15:59:57,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:59:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2018-12-30 15:59:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-30 15:59:57,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:59:57,833 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:59:57,833 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:59:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:59:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2018-12-30 15:59:57,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:59:57,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:59:57,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:57,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:59:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:59:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 15:59:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:59:58,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:59:58,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:59:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:59:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:58,016 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2018-12-30 15:59:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:59:58,332 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2018-12-30 15:59:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:59:58,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-30 15:59:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:59:58,337 INFO L225 Difference]: With dead ends: 264 [2018-12-30 15:59:58,337 INFO L226 Difference]: Without dead ends: 147 [2018-12-30 15:59:58,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-30 15:59:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-12-30 15:59:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-30 15:59:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2018-12-30 15:59:58,352 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2018-12-30 15:59:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:59:58,352 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2018-12-30 15:59:58,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:59:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2018-12-30 15:59:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-30 15:59:58,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:59:58,355 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:59:58,359 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:59:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:59:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2018-12-30 15:59:58,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:59:58,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:59:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:58,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:59:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:59:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 15:59:58,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:59:58,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:59:58,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:59:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:59:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:58,498 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2018-12-30 15:59:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:59:58,539 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2018-12-30 15:59:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:59:58,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-30 15:59:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:59:58,543 INFO L225 Difference]: With dead ends: 298 [2018-12-30 15:59:58,543 INFO L226 Difference]: Without dead ends: 164 [2018-12-30 15:59:58,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-30 15:59:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-30 15:59:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-30 15:59:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2018-12-30 15:59:58,563 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2018-12-30 15:59:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:59:58,564 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2018-12-30 15:59:58,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:59:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2018-12-30 15:59:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-30 15:59:58,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:59:58,571 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:59:58,571 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:59:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:59:58,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2018-12-30 15:59:58,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:59:58,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:59:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:58,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:59:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:59:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 15:59:58,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:59:58,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:59:58,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:59:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:59:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:58,718 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2018-12-30 15:59:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:59:59,100 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2018-12-30 15:59:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:59:59,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-30 15:59:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:59:59,105 INFO L225 Difference]: With dead ends: 369 [2018-12-30 15:59:59,105 INFO L226 Difference]: Without dead ends: 213 [2018-12-30 15:59:59,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-30 15:59:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2018-12-30 15:59:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-30 15:59:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2018-12-30 15:59:59,116 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2018-12-30 15:59:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:59:59,117 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2018-12-30 15:59:59,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:59:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2018-12-30 15:59:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-30 15:59:59,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:59:59,119 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:59:59,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:59:59,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:59:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2018-12-30 15:59:59,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:59:59,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:59:59,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:59,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:59:59,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:59:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 15:59:59,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:59:59,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:59:59,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:59:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:59:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:59,199 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2018-12-30 15:59:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 15:59:59,431 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2018-12-30 15:59:59,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 15:59:59,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-30 15:59:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 15:59:59,434 INFO L225 Difference]: With dead ends: 424 [2018-12-30 15:59:59,434 INFO L226 Difference]: Without dead ends: 228 [2018-12-30 15:59:59,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-12-30 15:59:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2018-12-30 15:59:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-30 15:59:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2018-12-30 15:59:59,445 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2018-12-30 15:59:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 15:59:59,445 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2018-12-30 15:59:59,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 15:59:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2018-12-30 15:59:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-30 15:59:59,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 15:59:59,448 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 15:59:59,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 15:59:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 15:59:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2018-12-30 15:59:59,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 15:59:59,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 15:59:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:59,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 15:59:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 15:59:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 15:59:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 15:59:59,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 15:59:59,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 15:59:59,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 15:59:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 15:59:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 15:59:59,561 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2018-12-30 16:00:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:00,002 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2018-12-30 16:00:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:00,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-30 16:00:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:00,007 INFO L225 Difference]: With dead ends: 463 [2018-12-30 16:00:00,007 INFO L226 Difference]: Without dead ends: 248 [2018-12-30 16:00:00,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-30 16:00:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2018-12-30 16:00:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-30 16:00:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2018-12-30 16:00:00,018 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2018-12-30 16:00:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:00,019 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2018-12-30 16:00:00,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2018-12-30 16:00:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-30 16:00:00,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:00,021 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:00,022 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:00,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2018-12-30 16:00:00,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:00:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:00:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:00,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-30 16:00:00,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:00,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:00,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:00,119 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2018-12-30 16:00:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:00,217 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2018-12-30 16:00:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:00,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-30 16:00:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:00,229 INFO L225 Difference]: With dead ends: 694 [2018-12-30 16:00:00,229 INFO L226 Difference]: Without dead ends: 458 [2018-12-30 16:00:00,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-12-30 16:00:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2018-12-30 16:00:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-12-30 16:00:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2018-12-30 16:00:00,263 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2018-12-30 16:00:00,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:00,263 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2018-12-30 16:00:00,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2018-12-30 16:00:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:00:00,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:00,266 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:00,266 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2018-12-30 16:00:00,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:00:00,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:00:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:00,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:00:00,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:00,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:00,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:00,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:00,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:00,374 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2018-12-30 16:00:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:00,718 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2018-12-30 16:00:00,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:00,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:00:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:00,727 INFO L225 Difference]: With dead ends: 673 [2018-12-30 16:00:00,727 INFO L226 Difference]: Without dead ends: 671 [2018-12-30 16:00:00,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-12-30 16:00:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2018-12-30 16:00:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-12-30 16:00:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2018-12-30 16:00:00,761 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2018-12-30 16:00:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:00,761 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2018-12-30 16:00:00,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2018-12-30 16:00:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-30 16:00:00,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:00,767 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:00,767 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:00,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:00,767 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2018-12-30 16:00:00,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:00:00,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:00:00,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:00,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:00,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-30 16:00:00,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:00,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:00,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:00,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:00,915 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2018-12-30 16:00:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:01,392 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2018-12-30 16:00:01,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:01,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-30 16:00:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:01,401 INFO L225 Difference]: With dead ends: 1483 [2018-12-30 16:00:01,401 INFO L226 Difference]: Without dead ends: 818 [2018-12-30 16:00:01,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-12-30 16:00:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2018-12-30 16:00:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-12-30 16:00:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2018-12-30 16:00:01,426 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2018-12-30 16:00:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:01,427 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2018-12-30 16:00:01,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2018-12-30 16:00:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-30 16:00:01,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:01,435 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:01,436 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2018-12-30 16:00:01,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:00:01,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:00:01,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:01,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:01,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-30 16:00:01,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:01,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:01,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:01,570 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2018-12-30 16:00:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:02,979 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2018-12-30 16:00:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:02,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-12-30 16:00:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:02,988 INFO L225 Difference]: With dead ends: 1845 [2018-12-30 16:00:02,989 INFO L226 Difference]: Without dead ends: 1015 [2018-12-30 16:00:02,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:02,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-30 16:00:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2018-12-30 16:00:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-12-30 16:00:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2018-12-30 16:00:03,021 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2018-12-30 16:00:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:03,021 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2018-12-30 16:00:03,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2018-12-30 16:00:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-30 16:00:03,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:03,027 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:03,027 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2018-12-30 16:00:03,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:00:03,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:00:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:03,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-30 16:00:03,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-12-30 16:00:03,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:03,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:03,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:03,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:03,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:03,215 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2018-12-30 16:00:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:03,307 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2018-12-30 16:00:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:03,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-12-30 16:00:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:03,315 INFO L225 Difference]: With dead ends: 2279 [2018-12-30 16:00:03,315 INFO L226 Difference]: Without dead ends: 1311 [2018-12-30 16:00:03,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2018-12-30 16:00:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2018-12-30 16:00:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2018-12-30 16:00:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2018-12-30 16:00:03,354 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2018-12-30 16:00:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:03,354 INFO L480 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2018-12-30 16:00:03,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2018-12-30 16:00:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-30 16:00:03,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:03,360 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:03,360 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2018-12-30 16:00:03,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:00:03,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:00:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:03,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-30 16:00:03,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:03,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:03,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:03,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:03,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:03,500 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2018-12-30 16:00:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:03,682 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2018-12-30 16:00:03,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:03,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2018-12-30 16:00:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:03,696 INFO L225 Difference]: With dead ends: 3667 [2018-12-30 16:00:03,697 INFO L226 Difference]: Without dead ends: 2365 [2018-12-30 16:00:03,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2018-12-30 16:00:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2018-12-30 16:00:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2018-12-30 16:00:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2018-12-30 16:00:03,791 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2018-12-30 16:00:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:03,791 INFO L480 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2018-12-30 16:00:03,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2018-12-30 16:00:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-30 16:00:03,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:03,798 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:03,798 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2018-12-30 16:00:03,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:00:03,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:00:03,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:03,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:03,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:00:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:00:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:00:03,990 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:00:04,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:00:04 BoogieIcfgContainer [2018-12-30 16:00:04,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:00:04,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:00:04,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:00:04,122 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:00:04,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 03:59:56" (3/4) ... [2018-12-30 16:00:04,127 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-30 16:00:04,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:00:04,132 INFO L168 Benchmark]: Toolchain (without parser) took 9860.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -286.2 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:04,136 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-12-30 16:00:04,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.06 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.5 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:04,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:04,141 INFO L168 Benchmark]: Boogie Preprocessor took 39.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:04,143 INFO L168 Benchmark]: RCFGBuilder took 1219.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:04,144 INFO L168 Benchmark]: TraceAbstraction took 8072.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -159.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:00:04,148 INFO L168 Benchmark]: Witness Printer took 9.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:00:04,156 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 373.06 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.5 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 138.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1219.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8072.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -159.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.96 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 606]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 354. Possible FailurePath: [L615] int __retres1 ; [L8] int s__info_callback = __VERIFIER_nondet_int(); [L9] int s__in_handshake = __VERIFIER_nondet_int(); [L10] int s__state ; [L11] int s__new_session ; [L12] int s__server ; [L13] int s__version = __VERIFIER_nondet_int(); [L14] int s__type ; [L15] int s__init_num ; [L16] int s__bbio = __VERIFIER_nondet_int(); [L17] int s__wbio = __VERIFIER_nondet_int(); [L18] int s__hit = __VERIFIER_nondet_int(); [L19] int s__rwstate ; [L20] int s__init_buf___0 ; [L21] int s__debug = __VERIFIER_nondet_int(); [L22] int s__shutdown ; [L23] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L24] int s__ctx__stats__sess_connect_renegotiate ; [L25] int s__ctx__stats__sess_connect ; [L26] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L27] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [L28] int s__s3__change_cipher_spec ; [L29] int s__s3__flags ; [L30] int s__s3__delay_buf_pop_ret ; [L31] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L32] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__next_state___0 ; [L37] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L38] int s__session__cipher ; [L39] int s__session__compress_meth ; [L40] int buf ; [L41] unsigned long tmp ; [L42] unsigned long l ; [L43] int num1 ; [L44] int cb ; [L45] int ret ; [L46] int new_state ; [L47] int state ; [L48] int skip ; [L49] int tmp___0 ; [L50] int tmp___1 = __VERIFIER_nondet_int(); [L51] int tmp___2 = __VERIFIER_nondet_int(); [L52] int tmp___3 = __VERIFIER_nondet_int(); [L53] int tmp___4 = __VERIFIER_nondet_int(); [L54] int tmp___5 = __VERIFIER_nondet_int(); [L55] int tmp___6 = __VERIFIER_nondet_int(); [L56] int tmp___7 = __VERIFIER_nondet_int(); [L57] int tmp___8 = __VERIFIER_nondet_int(); [L58] int tmp___9 = __VERIFIER_nondet_int(); [L59] int blastFlag ; [L60] int ag_X ; [L61] int ag_Y = __VERIFIER_nondet_int(); [L62] int __retres59 ; [L65] s__state = 12292 [L66] blastFlag = 0 [L67] tmp = __VERIFIER_nondet_int() [L68] cb = 0 [L69] ret = -1 [L70] skip = 0 [L71] tmp___0 = 0 [L72] COND TRUE s__info_callback != 0 [L73] cb = s__info_callback [L81] s__in_handshake = s__in_handshake + 1 [L82] COND FALSE !(tmp___1 - 12288) [L92] COND TRUE 1 [L94] state = s__state [L95] COND TRUE s__state == 12292 [L198] s__new_session = 1 [L199] s__state = 4096 [L200] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L205] s__server = 0 [L206] COND TRUE cb != 0 [L211] COND FALSE !(s__version - 65280 != 768) [L217] s__type = 4096 [L218] COND FALSE !(s__init_buf___0 == 0) [L236] COND FALSE !(! tmp___4) [L242] COND FALSE !(! tmp___5) [L248] s__state = 4368 [L249] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L250] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND TRUE blastFlag == 0 [L257] blastFlag = 1 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND TRUE blastFlag == 1 [L282] blastFlag = 2 [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND TRUE blastFlag == 2 [L305] blastFlag = 3 [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND TRUE blastFlag == 3 [L322] blastFlag = 4 [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND FALSE !(blastFlag == 5) [L349] COND FALSE !(ret <= 0) [L354] s__state = ag_X ^ ag_Y [L355] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND FALSE !(blastFlag == 0) [L259] COND TRUE blastFlag == 4 [L260] blastFlag = 5 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND FALSE !(blastFlag == 1) [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND FALSE !(blastFlag == 2) [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND FALSE !(blastFlag == 3) [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND TRUE blastFlag == 5 [L606] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. UNSAFE Result, 7.9s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:00:06,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:00:06,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:00:06,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:00:06,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:00:06,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:00:06,538 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:00:06,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:00:06,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:00:06,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:00:06,543 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:00:06,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:00:06,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:00:06,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:00:06,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:00:06,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:00:06,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:00:06,550 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:00:06,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:00:06,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:00:06,554 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:00:06,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:00:06,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:00:06,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:00:06,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:00:06,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:00:06,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:00:06,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:00:06,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:00:06,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:00:06,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:00:06,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:00:06,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:00:06,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:00:06,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:00:06,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:00:06,573 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-30 16:00:06,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:00:06,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:00:06,589 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:00:06,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:00:06,589 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:00:06,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:00:06,590 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:00:06,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:00:06,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:00:06,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:00:06,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:00:06,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:00:06,591 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-30 16:00:06,591 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-30 16:00:06,591 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:00:06,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:00:06,591 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:00:06,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:00:06,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:00:06,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:00:06,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:00:06,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:00:06,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:00:06,593 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:00:06,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:00:06,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:00:06,593 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-30 16:00:06,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:00:06,593 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-30 16:00:06,594 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-30 16:00:06,594 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 -> 0bf79c30a8b941af2e2e52ff71757957757c98e5 [2018-12-30 16:00:06,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:00:06,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:00:06,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:00:06,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:00:06,654 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:00:06,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:00:06,714 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1bb25d8/4b593aa4da114f259fd5019c4d5e7b6d/FLAGf9d38160a [2018-12-30 16:00:07,221 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:00:07,226 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:00:07,250 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1bb25d8/4b593aa4da114f259fd5019c4d5e7b6d/FLAGf9d38160a [2018-12-30 16:00:07,497 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1bb25d8/4b593aa4da114f259fd5019c4d5e7b6d [2018-12-30 16:00:07,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:00:07,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:00:07,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:00:07,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:00:07,506 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:00:07,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:07,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13565624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07, skipping insertion in model container [2018-12-30 16:00:07,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:07,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:00:07,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:00:07,799 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:00:07,804 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:00:07,863 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:00:07,879 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:00:07,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07 WrapperNode [2018-12-30 16:00:07,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:00:07,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:00:07,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:00:07,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:00:07,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:07,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:07,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:00:07,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:00:07,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:00:07,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:00:08,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:08,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:08,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:08,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:08,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:08,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:08,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... [2018-12-30 16:00:08,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:00:08,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:00:08,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:00:08,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:00:08,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:00:08,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:00:08,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:00:08,267 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:00:08,267 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:00:09,337 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:00:09,338 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 16:00:09,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:00:09 BoogieIcfgContainer [2018-12-30 16:00:09,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:00:09,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:00:09,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:00:09,344 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:00:09,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:00:07" (1/3) ... [2018-12-30 16:00:09,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc394da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:00:09, skipping insertion in model container [2018-12-30 16:00:09,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:00:07" (2/3) ... [2018-12-30 16:00:09,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc394da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:00:09, skipping insertion in model container [2018-12-30 16:00:09,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:00:09" (3/3) ... [2018-12-30 16:00:09,348 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_false-unreach-call_true-no-overflow.BV.c.cil.c [2018-12-30 16:00:09,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:00:09,364 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:00:09,381 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:00:09,416 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:00:09,417 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:00:09,417 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:00:09,417 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:00:09,418 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:00:09,418 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:00:09,419 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:00:09,419 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:00:09,419 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:00:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-12-30 16:00:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:00:09,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:09,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:09,450 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:09,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2018-12-30 16:00:09,460 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:09,460 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:09,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:09,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:00:09,581 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:09,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:09,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:00:09,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:09,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:09,614 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2018-12-30 16:00:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:10,356 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2018-12-30 16:00:10,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:10,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:00:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:10,381 INFO L225 Difference]: With dead ends: 245 [2018-12-30 16:00:10,382 INFO L226 Difference]: Without dead ends: 111 [2018-12-30 16:00:10,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-30 16:00:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-30 16:00:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-30 16:00:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2018-12-30 16:00:10,446 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2018-12-30 16:00:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:10,446 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2018-12-30 16:00:10,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2018-12-30 16:00:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:00:10,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:10,448 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:10,449 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2018-12-30 16:00:10,450 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:10,450 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:10,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:10,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:00:10,597 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-12-30 16:00:10,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:10,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:10,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:10,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:10,605 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2018-12-30 16:00:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:10,878 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2018-12-30 16:00:10,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:10,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-30 16:00:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:10,882 INFO L225 Difference]: With dead ends: 232 [2018-12-30 16:00:10,883 INFO L226 Difference]: Without dead ends: 130 [2018-12-30 16:00:10,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:10,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-30 16:00:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-30 16:00:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-30 16:00:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2018-12-30 16:00:10,897 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2018-12-30 16:00:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:10,897 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2018-12-30 16:00:10,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2018-12-30 16:00:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-30 16:00:10,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:10,901 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:10,902 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:10,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2018-12-30 16:00:10,904 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:10,904 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:10,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:10,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 16:00:11,031 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:11,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:11,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:11,038 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2018-12-30 16:00:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:11,307 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2018-12-30 16:00:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:11,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-30 16:00:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:11,311 INFO L225 Difference]: With dead ends: 264 [2018-12-30 16:00:11,311 INFO L226 Difference]: Without dead ends: 147 [2018-12-30 16:00:11,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-30 16:00:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-12-30 16:00:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-30 16:00:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2018-12-30 16:00:11,338 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2018-12-30 16:00:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:11,339 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2018-12-30 16:00:11,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2018-12-30 16:00:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-30 16:00:11,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:11,343 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:11,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2018-12-30 16:00:11,344 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:11,345 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:11,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:11,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 16:00:11,502 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:11,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:11,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:11,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:11,509 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2018-12-30 16:00:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:11,604 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2018-12-30 16:00:11,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:11,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-30 16:00:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:11,610 INFO L225 Difference]: With dead ends: 298 [2018-12-30 16:00:11,610 INFO L226 Difference]: Without dead ends: 164 [2018-12-30 16:00:11,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-30 16:00:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-30 16:00:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-30 16:00:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2018-12-30 16:00:11,624 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2018-12-30 16:00:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:11,624 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2018-12-30 16:00:11,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2018-12-30 16:00:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-30 16:00:11,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:11,627 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:11,628 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2018-12-30 16:00:11,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:11,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:11,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:11,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-30 16:00:11,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:11,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:11,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:11,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:11,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:11,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:11,742 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2018-12-30 16:00:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:11,816 INFO L93 Difference]: Finished difference Result 450 states and 656 transitions. [2018-12-30 16:00:11,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:11,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-30 16:00:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:11,820 INFO L225 Difference]: With dead ends: 450 [2018-12-30 16:00:11,820 INFO L226 Difference]: Without dead ends: 295 [2018-12-30 16:00:11,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-30 16:00:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-12-30 16:00:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-12-30 16:00:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 426 transitions. [2018-12-30 16:00:11,844 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 426 transitions. Word has length 66 [2018-12-30 16:00:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:11,845 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 426 transitions. [2018-12-30 16:00:11,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 426 transitions. [2018-12-30 16:00:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-30 16:00:11,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:11,849 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:11,850 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2018-12-30 16:00:11,850 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:11,851 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:11,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:11,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 16:00:11,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:11,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:11,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 16:00:11,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:11,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:11,994 INFO L87 Difference]: Start difference. First operand 295 states and 426 transitions. Second operand 3 states. [2018-12-30 16:00:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:12,110 INFO L93 Difference]: Finished difference Result 607 states and 873 transitions. [2018-12-30 16:00:12,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:12,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-30 16:00:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:12,115 INFO L225 Difference]: With dead ends: 607 [2018-12-30 16:00:12,115 INFO L226 Difference]: Without dead ends: 321 [2018-12-30 16:00:12,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-30 16:00:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-12-30 16:00:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-30 16:00:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 459 transitions. [2018-12-30 16:00:12,135 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 459 transitions. Word has length 67 [2018-12-30 16:00:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:12,135 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 459 transitions. [2018-12-30 16:00:12,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 459 transitions. [2018-12-30 16:00:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-30 16:00:12,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:12,139 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:12,139 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:12,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1820481258, now seen corresponding path program 1 times [2018-12-30 16:00:12,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:12,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:12,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 16:00:12,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:12,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:12,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:12,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:12,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:12,269 INFO L87 Difference]: Start difference. First operand 321 states and 459 transitions. Second operand 3 states. [2018-12-30 16:00:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:12,531 INFO L93 Difference]: Finished difference Result 655 states and 955 transitions. [2018-12-30 16:00:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:12,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-30 16:00:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:12,542 INFO L225 Difference]: With dead ends: 655 [2018-12-30 16:00:12,542 INFO L226 Difference]: Without dead ends: 369 [2018-12-30 16:00:12,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-30 16:00:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2018-12-30 16:00:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-30 16:00:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 511 transitions. [2018-12-30 16:00:12,570 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 511 transitions. Word has length 84 [2018-12-30 16:00:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:12,571 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 511 transitions. [2018-12-30 16:00:12,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 511 transitions. [2018-12-30 16:00:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:00:12,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:12,576 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:12,576 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:12,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:12,577 INFO L82 PathProgramCache]: Analyzing trace with hash 644642210, now seen corresponding path program 1 times [2018-12-30 16:00:12,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:12,577 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:12,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:12,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-30 16:00:12,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:12,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:12,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:12,775 INFO L87 Difference]: Start difference. First operand 363 states and 511 transitions. Second operand 3 states. [2018-12-30 16:00:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:13,055 INFO L93 Difference]: Finished difference Result 777 states and 1134 transitions. [2018-12-30 16:00:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:13,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:00:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:13,064 INFO L225 Difference]: With dead ends: 777 [2018-12-30 16:00:13,064 INFO L226 Difference]: Without dead ends: 449 [2018-12-30 16:00:13,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-30 16:00:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 443. [2018-12-30 16:00:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-30 16:00:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 601 transitions. [2018-12-30 16:00:13,081 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 601 transitions. Word has length 104 [2018-12-30 16:00:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:13,084 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 601 transitions. [2018-12-30 16:00:13,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 601 transitions. [2018-12-30 16:00:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:00:13,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:13,086 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:13,086 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:13,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2018-12-30 16:00:13,087 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:13,087 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:13,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:13,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-30 16:00:13,191 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:13,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:13,194 INFO L87 Difference]: Start difference. First operand 443 states and 601 transitions. Second operand 3 states. [2018-12-30 16:00:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:13,505 INFO L93 Difference]: Finished difference Result 1025 states and 1398 transitions. [2018-12-30 16:00:13,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:13,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:00:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:13,511 INFO L225 Difference]: With dead ends: 1025 [2018-12-30 16:00:13,512 INFO L226 Difference]: Without dead ends: 617 [2018-12-30 16:00:13,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-12-30 16:00:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2018-12-30 16:00:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-12-30 16:00:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 837 transitions. [2018-12-30 16:00:13,541 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 837 transitions. Word has length 104 [2018-12-30 16:00:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:13,542 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 837 transitions. [2018-12-30 16:00:13,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 837 transitions. [2018-12-30 16:00:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 16:00:13,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:13,544 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:13,544 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1822763934, now seen corresponding path program 1 times [2018-12-30 16:00:13,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:13,545 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:13,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:13,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 16:00:13,706 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:13,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:13,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:13,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:13,711 INFO L87 Difference]: Start difference. First operand 617 states and 837 transitions. Second operand 3 states. [2018-12-30 16:00:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:13,892 INFO L93 Difference]: Finished difference Result 1224 states and 1659 transitions. [2018-12-30 16:00:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:13,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-30 16:00:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:13,899 INFO L225 Difference]: With dead ends: 1224 [2018-12-30 16:00:13,900 INFO L226 Difference]: Without dead ends: 642 [2018-12-30 16:00:13,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-30 16:00:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2018-12-30 16:00:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-12-30 16:00:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 867 transitions. [2018-12-30 16:00:13,925 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 867 transitions. Word has length 104 [2018-12-30 16:00:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:13,925 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 867 transitions. [2018-12-30 16:00:13,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 867 transitions. [2018-12-30 16:00:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-30 16:00:13,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:13,928 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:13,928 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash 868654639, now seen corresponding path program 1 times [2018-12-30 16:00:13,929 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:13,929 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:13,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:14,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-30 16:00:14,096 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:14,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:14,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:14,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:14,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:14,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:14,101 INFO L87 Difference]: Start difference. First operand 642 states and 867 transitions. Second operand 3 states. [2018-12-30 16:00:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:15,261 INFO L93 Difference]: Finished difference Result 1319 states and 1807 transitions. [2018-12-30 16:00:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:15,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-12-30 16:00:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:15,268 INFO L225 Difference]: With dead ends: 1319 [2018-12-30 16:00:15,269 INFO L226 Difference]: Without dead ends: 712 [2018-12-30 16:00:15,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-12-30 16:00:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 699. [2018-12-30 16:00:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-12-30 16:00:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 939 transitions. [2018-12-30 16:00:15,289 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 939 transitions. Word has length 136 [2018-12-30 16:00:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:15,290 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 939 transitions. [2018-12-30 16:00:15,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 939 transitions. [2018-12-30 16:00:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-30 16:00:15,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:15,294 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:15,294 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2018-12-30 16:00:15,296 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:15,296 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:15,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:15,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-30 16:00:15,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:15,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:15,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:15,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:15,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:15,481 INFO L87 Difference]: Start difference. First operand 699 states and 939 transitions. Second operand 3 states. [2018-12-30 16:00:15,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:15,567 INFO L93 Difference]: Finished difference Result 1572 states and 2115 transitions. [2018-12-30 16:00:15,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:15,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-30 16:00:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:15,576 INFO L225 Difference]: With dead ends: 1572 [2018-12-30 16:00:15,576 INFO L226 Difference]: Without dead ends: 908 [2018-12-30 16:00:15,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-12-30 16:00:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2018-12-30 16:00:15,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-12-30 16:00:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1219 transitions. [2018-12-30 16:00:15,605 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1219 transitions. Word has length 172 [2018-12-30 16:00:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:15,605 INFO L480 AbstractCegarLoop]: Abstraction has 908 states and 1219 transitions. [2018-12-30 16:00:15,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1219 transitions. [2018-12-30 16:00:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-30 16:00:15,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:15,610 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:15,610 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2018-12-30 16:00:15,611 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:15,611 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:15,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-30 16:00:15,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:15,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:15,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:15,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:15,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:15,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:15,808 INFO L87 Difference]: Start difference. First operand 908 states and 1219 transitions. Second operand 3 states. [2018-12-30 16:00:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:15,982 INFO L93 Difference]: Finished difference Result 2244 states and 3044 transitions. [2018-12-30 16:00:15,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:15,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-30 16:00:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:15,991 INFO L225 Difference]: With dead ends: 2244 [2018-12-30 16:00:15,991 INFO L226 Difference]: Without dead ends: 1392 [2018-12-30 16:00:15,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2018-12-30 16:00:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2018-12-30 16:00:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2018-12-30 16:00:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1885 transitions. [2018-12-30 16:00:16,046 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1885 transitions. Word has length 174 [2018-12-30 16:00:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:16,046 INFO L480 AbstractCegarLoop]: Abstraction has 1390 states and 1885 transitions. [2018-12-30 16:00:16,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1885 transitions. [2018-12-30 16:00:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-30 16:00:16,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:16,052 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:16,053 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2018-12-30 16:00:16,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:16,054 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:16,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:16,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-12-30 16:00:16,298 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:16,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:16,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:16,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:16,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:16,303 INFO L87 Difference]: Start difference. First operand 1390 states and 1885 transitions. Second operand 3 states. [2018-12-30 16:00:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:16,456 INFO L93 Difference]: Finished difference Result 2166 states and 2923 transitions. [2018-12-30 16:00:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:16,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-30 16:00:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:16,464 INFO L225 Difference]: With dead ends: 2166 [2018-12-30 16:00:16,464 INFO L226 Difference]: Without dead ends: 1394 [2018-12-30 16:00:16,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-12-30 16:00:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1392. [2018-12-30 16:00:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-12-30 16:00:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1878 transitions. [2018-12-30 16:00:16,513 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1878 transitions. Word has length 174 [2018-12-30 16:00:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:16,514 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1878 transitions. [2018-12-30 16:00:16,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1878 transitions. [2018-12-30 16:00:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-30 16:00:16,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:16,519 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:16,519 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2018-12-30 16:00:16,520 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:16,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:16,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:00:16,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:00:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-12-30 16:00:16,697 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-30 16:00:16,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:00:16,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:00:16,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:00:16,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:00:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:16,701 INFO L87 Difference]: Start difference. First operand 1392 states and 1878 transitions. Second operand 3 states. [2018-12-30 16:00:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:00:17,603 INFO L93 Difference]: Finished difference Result 2910 states and 3998 transitions. [2018-12-30 16:00:17,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:00:17,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-30 16:00:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:00:17,612 INFO L225 Difference]: With dead ends: 2910 [2018-12-30 16:00:17,612 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 16:00:17,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:00:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 16:00:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1553. [2018-12-30 16:00:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2018-12-30 16:00:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2074 transitions. [2018-12-30 16:00:17,661 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2074 transitions. Word has length 174 [2018-12-30 16:00:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:00:17,661 INFO L480 AbstractCegarLoop]: Abstraction has 1553 states and 2074 transitions. [2018-12-30 16:00:17,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:00:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2074 transitions. [2018-12-30 16:00:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-30 16:00:17,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:00:17,667 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:00:17,667 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:00:17,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:00:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2018-12-30 16:00:17,669 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-30 16:00:17,669 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-30 16:00:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:00:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:00:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:00:18,395 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:00:18,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:00:18 BoogieIcfgContainer [2018-12-30 16:00:18,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:00:18,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:00:18,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:00:18,495 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:00:18,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:00:09" (3/4) ... [2018-12-30 16:00:18,499 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 16:00:18,670 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:00:18,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:00:18,675 INFO L168 Benchmark]: Toolchain (without parser) took 11173.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 954.1 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 191.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:18,676 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:00:18,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.08 ms. Allocated memory is still 1.0 GB. Free memory was 954.1 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-12-30 16:00:18,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.29 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:18,680 INFO L168 Benchmark]: Boogie Preprocessor took 112.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:18,680 INFO L168 Benchmark]: RCFGBuilder took 1291.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:18,681 INFO L168 Benchmark]: TraceAbstraction took 9153.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.2 MB). Peak memory consumption was 160.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:18,681 INFO L168 Benchmark]: Witness Printer took 178.45 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:00:18,685 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.08 ms. Allocated memory is still 1.0 GB. Free memory was 954.1 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 54.29 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1291.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9153.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.2 MB). Peak memory consumption was 160.5 MB. Max. memory is 11.5 GB. * Witness Printer took 178.45 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 606]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L615] int __retres1 ; [L8] int s__info_callback = __VERIFIER_nondet_int(); [L9] int s__in_handshake = __VERIFIER_nondet_int(); [L10] int s__state ; [L11] int s__new_session ; [L12] int s__server ; [L13] int s__version = __VERIFIER_nondet_int(); [L14] int s__type ; [L15] int s__init_num ; [L16] int s__bbio = __VERIFIER_nondet_int(); [L17] int s__wbio = __VERIFIER_nondet_int(); [L18] int s__hit = __VERIFIER_nondet_int(); [L19] int s__rwstate ; [L20] int s__init_buf___0 ; [L21] int s__debug = __VERIFIER_nondet_int(); [L22] int s__shutdown ; [L23] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L24] int s__ctx__stats__sess_connect_renegotiate ; [L25] int s__ctx__stats__sess_connect ; [L26] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L27] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [L28] int s__s3__change_cipher_spec ; [L29] int s__s3__flags ; [L30] int s__s3__delay_buf_pop_ret ; [L31] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L32] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__next_state___0 ; [L37] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L38] int s__session__cipher ; [L39] int s__session__compress_meth ; [L40] int buf ; [L41] unsigned long tmp ; [L42] unsigned long l ; [L43] int num1 ; [L44] int cb ; [L45] int ret ; [L46] int new_state ; [L47] int state ; [L48] int skip ; [L49] int tmp___0 ; [L50] int tmp___1 = __VERIFIER_nondet_int(); [L51] int tmp___2 = __VERIFIER_nondet_int(); [L52] int tmp___3 = __VERIFIER_nondet_int(); [L53] int tmp___4 = __VERIFIER_nondet_int(); [L54] int tmp___5 = __VERIFIER_nondet_int(); [L55] int tmp___6 = __VERIFIER_nondet_int(); [L56] int tmp___7 = __VERIFIER_nondet_int(); [L57] int tmp___8 = __VERIFIER_nondet_int(); [L58] int tmp___9 = __VERIFIER_nondet_int(); [L59] int blastFlag ; [L60] int ag_X ; [L61] int ag_Y = __VERIFIER_nondet_int(); [L62] int __retres59 ; [L65] s__state = 12292 [L66] blastFlag = 0 [L67] tmp = __VERIFIER_nondet_int() [L68] cb = 0 [L69] ret = -1 [L70] skip = 0 [L71] tmp___0 = 0 [L72] COND TRUE s__info_callback != 0 [L73] cb = s__info_callback [L81] s__in_handshake = s__in_handshake + 1 [L82] COND FALSE !(tmp___1 - 12288) [L92] COND TRUE 1 [L94] state = s__state [L95] COND TRUE s__state == 12292 [L198] s__new_session = 1 [L199] s__state = 4096 [L200] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L205] s__server = 0 [L206] COND TRUE cb != 0 [L211] COND FALSE !(s__version - 65280 != 768) [L217] s__type = 4096 [L218] COND FALSE !(s__init_buf___0 == 0) [L236] COND FALSE !(! tmp___4) [L242] COND FALSE !(! tmp___5) [L248] s__state = 4368 [L249] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L250] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND TRUE blastFlag == 0 [L257] blastFlag = 1 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND TRUE blastFlag == 1 [L282] blastFlag = 2 [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND TRUE blastFlag == 2 [L305] blastFlag = 3 [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND TRUE blastFlag == 3 [L322] blastFlag = 4 [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND FALSE !(blastFlag == 5) [L349] COND FALSE !(ret <= 0) [L354] s__state = ag_X ^ ag_Y [L355] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND TRUE s__state == 4368 [L254] s__shutdown = 0 [L255] ret = __VERIFIER_nondet_int() [L256] COND FALSE !(blastFlag == 0) [L259] COND TRUE blastFlag == 4 [L260] blastFlag = 5 [L265] COND FALSE !(ret <= 0) [L270] s__state = 4384 [L271] s__init_num = 0 [L272] COND TRUE s__bbio != s__wbio [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND TRUE s__state == 4384 [L280] ret = __VERIFIER_nondet_int() [L281] COND FALSE !(blastFlag == 1) [L286] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 4400 [L296] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND TRUE s__state == 4400 [L300] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L303] ret = __VERIFIER_nondet_int() [L304] COND FALSE !(blastFlag == 2) [L309] COND FALSE !(ret <= 0) [L315] s__state = 4416 [L316] s__init_num = 0 [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND TRUE s__state == 4416 [L320] ret = __VERIFIER_nondet_int() [L321] COND FALSE !(blastFlag == 3) [L326] COND FALSE !(ret <= 0) [L331] s__state = 4432 [L332] ag_X = (unsigned short)65535 [L333] s__init_num = 0 [L334] COND FALSE !(! tmp___6) [L564] COND FALSE !(! s__s3__tmp__reuse_message) [L593] skip = 0 [L92] COND TRUE 1 [L94] state = s__state [L95] COND FALSE !(s__state == 12292) [L98] COND FALSE !(s__state == 16384) [L101] COND FALSE !(s__state == 4096) [L104] COND FALSE !(s__state == 20480) [L107] COND FALSE !(s__state == 4099) [L110] COND FALSE !(s__state == 4368) [L113] COND FALSE !(s__state == 4369) [L116] COND FALSE !(s__state == 4384) [L119] COND FALSE !(s__state == 4385) [L122] COND FALSE !(s__state == 4400) [L125] COND FALSE !(s__state == 4401) [L128] COND FALSE !(s__state == 4416) [L131] COND FALSE !(s__state == 4417) [L134] COND TRUE s__state == 4432 [L343] ret = __VERIFIER_nondet_int() [L344] COND TRUE blastFlag == 5 [L606] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. UNSAFE Result, 9.0s OverallTime, 16 OverallIterations, 11 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3086 SDtfs, 728 SDslu, 1794 SDs, 0 SdLazy, 792 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1517 GetRequests, 1502 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1553occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 60 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1727 NumberOfCodeBlocks, 1727 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1517 ConstructedInterpolants, 0 QuantifiedInterpolants, 320287 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2310 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 2563/2563 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...