./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 96530338 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 ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15_false-unreach-call.i.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 00e4f55488ef7cc05fee246c4257b6c9346382d0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15_false-unreach-call.i.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 00e4f55488ef7cc05fee246c4257b6c9346382d0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-9653033 [2018-11-26 13:13:41,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-26 13:13:41,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-26 13:13:41,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-26 13:13:41,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-26 13:13:41,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-26 13:13:41,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-26 13:13:41,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-26 13:13:41,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-26 13:13:41,494 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-26 13:13:41,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-26 13:13:41,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-26 13:13:41,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-26 13:13:41,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-26 13:13:41,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-26 13:13:41,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-26 13:13:41,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-26 13:13:41,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-26 13:13:41,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-26 13:13:41,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-26 13:13:41,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-26 13:13:41,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-26 13:13:41,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-26 13:13:41,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-26 13:13:41,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-26 13:13:41,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-26 13:13:41,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-26 13:13:41,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-26 13:13:41,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-26 13:13:41,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-26 13:13:41,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-26 13:13:41,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-26 13:13:41,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-26 13:13:41,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-26 13:13:41,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-26 13:13:41,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-26 13:13:41,521 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-26 13:13:41,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-26 13:13:41,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-26 13:13:41,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-26 13:13:41,536 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-26 13:13:41,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-26 13:13:41,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-26 13:13:41,537 INFO L133 SettingsManager]: * Use SBE=true [2018-11-26 13:13:41,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-26 13:13:41,538 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-26 13:13:41,538 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-26 13:13:41,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-26 13:13:41,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-26 13:13:41,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-26 13:13:41,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-26 13:13:41,539 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-26 13:13:41,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-26 13:13:41,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-26 13:13:41,539 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-26 13:13:41,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-26 13:13:41,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-26 13:13:41,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-26 13:13:41,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-26 13:13:41,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-26 13:13:41,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:13:41,541 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-26 13:13:41,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-26 13:13:41,541 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-26 13:13:41,541 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-26 13:13:41,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-26 13:13:41,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-26 13:13:41,542 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 -> 00e4f55488ef7cc05fee246c4257b6c9346382d0 [2018-11-26 13:13:41,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-26 13:13:41,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-26 13:13:41,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-26 13:13:41,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-26 13:13:41,602 INFO L276 PluginConnector]: CDTParser initialized [2018-11-26 13:13:41,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-11-26 13:13:41,652 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed60d3016/80210e7d3f2d40cfae838d446fe0b84f/FLAGfa22a41b7 [2018-11-26 13:13:42,135 INFO L307 CDTParser]: Found 1 translation units. [2018-11-26 13:13:42,135 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-11-26 13:13:42,153 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed60d3016/80210e7d3f2d40cfae838d446fe0b84f/FLAGfa22a41b7 [2018-11-26 13:13:42,626 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed60d3016/80210e7d3f2d40cfae838d446fe0b84f [2018-11-26 13:13:42,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-26 13:13:42,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-26 13:13:42,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-26 13:13:42,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-26 13:13:42,635 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-26 13:13:42,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:13:42" (1/1) ... [2018-11-26 13:13:42,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c692479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:42, skipping insertion in model container [2018-11-26 13:13:42,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:13:42" (1/1) ... [2018-11-26 13:13:42,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-26 13:13:42,712 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-26 13:13:43,102 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:13:43,194 INFO L191 MainTranslator]: Completed pre-run [2018-11-26 13:13:43,299 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:13:43,322 INFO L195 MainTranslator]: Completed translation [2018-11-26 13:13:43,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43 WrapperNode [2018-11-26 13:13:43,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-26 13:13:43,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-26 13:13:43,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-26 13:13:43,324 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-26 13:13:43,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-26 13:13:43,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-26 13:13:43,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-26 13:13:43,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-26 13:13:43,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... [2018-11-26 13:13:43,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-26 13:13:43,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-26 13:13:43,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-26 13:13:43,465 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-26 13:13:43,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:13:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-26 13:13:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-26 13:13:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-26 13:13:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-26 13:13:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-26 13:13:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-26 13:13:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-26 13:13:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-26 13:13:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-26 13:13:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-26 13:13:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-26 13:13:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-26 13:13:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-26 13:13:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-26 13:13:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-26 13:13:43,825 WARN L645 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-26 13:13:43,826 WARN L610 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-26 13:13:44,509 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-26 13:13:44,510 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-26 13:13:44,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:13:44 BoogieIcfgContainer [2018-11-26 13:13:44,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-26 13:13:44,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-26 13:13:44,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-26 13:13:44,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-26 13:13:44,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:13:42" (1/3) ... [2018-11-26 13:13:44,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f1bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:13:44, skipping insertion in model container [2018-11-26 13:13:44,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:13:43" (2/3) ... [2018-11-26 13:13:44,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f1bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:13:44, skipping insertion in model container [2018-11-26 13:13:44,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:13:44" (3/3) ... [2018-11-26 13:13:44,518 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-11-26 13:13:44,526 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-26 13:13:44,535 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-26 13:13:44,550 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-26 13:13:44,581 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-26 13:13:44,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-26 13:13:44,582 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-26 13:13:44,582 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-26 13:13:44,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-26 13:13:44,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-26 13:13:44,583 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-26 13:13:44,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-26 13:13:44,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-26 13:13:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-11-26 13:13:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-26 13:13:44,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:44,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:44,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:44,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1596262401, now seen corresponding path program 1 times [2018-11-26 13:13:44,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:44,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:44,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:44,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:44,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:44,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:44,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:44,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:45,000 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-11-26 13:13:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:45,498 INFO L93 Difference]: Finished difference Result 339 states and 570 transitions. [2018-11-26 13:13:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:45,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-26 13:13:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:45,513 INFO L225 Difference]: With dead ends: 339 [2018-11-26 13:13:45,513 INFO L226 Difference]: Without dead ends: 172 [2018-11-26 13:13:45,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-26 13:13:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-11-26 13:13:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-26 13:13:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2018-11-26 13:13:45,569 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 49 [2018-11-26 13:13:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:45,569 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2018-11-26 13:13:45,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2018-11-26 13:13:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-26 13:13:45,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:45,573 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:45,574 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:45,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:45,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1059853705, now seen corresponding path program 1 times [2018-11-26 13:13:45,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:45,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:45,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:45,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:45,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:45,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:45,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:45,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:45,734 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2018-11-26 13:13:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:46,051 INFO L93 Difference]: Finished difference Result 302 states and 461 transitions. [2018-11-26 13:13:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:46,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-26 13:13:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:46,056 INFO L225 Difference]: With dead ends: 302 [2018-11-26 13:13:46,056 INFO L226 Difference]: Without dead ends: 172 [2018-11-26 13:13:46,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-26 13:13:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-11-26 13:13:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-26 13:13:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2018-11-26 13:13:46,068 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 62 [2018-11-26 13:13:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:46,069 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2018-11-26 13:13:46,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2018-11-26 13:13:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-26 13:13:46,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:46,072 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:46,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:46,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash 337135581, now seen corresponding path program 1 times [2018-11-26 13:13:46,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:46,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:46,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:46,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:46,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:13:46,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:13:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:13:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:46,198 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 5 states. [2018-11-26 13:13:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:46,655 INFO L93 Difference]: Finished difference Result 306 states and 469 transitions. [2018-11-26 13:13:46,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:13:46,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-26 13:13:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:46,658 INFO L225 Difference]: With dead ends: 306 [2018-11-26 13:13:46,658 INFO L226 Difference]: Without dead ends: 176 [2018-11-26 13:13:46,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:13:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-26 13:13:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-11-26 13:13:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-26 13:13:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 263 transitions. [2018-11-26 13:13:46,675 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 263 transitions. Word has length 63 [2018-11-26 13:13:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:46,676 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 263 transitions. [2018-11-26 13:13:46,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:13:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 263 transitions. [2018-11-26 13:13:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-26 13:13:46,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:46,679 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:46,679 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:46,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1452142420, now seen corresponding path program 1 times [2018-11-26 13:13:46,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:46,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:46,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:46,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:46,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:46,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:46,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:46,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:46,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:46,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:46,777 INFO L87 Difference]: Start difference. First operand 175 states and 263 transitions. Second operand 4 states. [2018-11-26 13:13:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:47,081 INFO L93 Difference]: Finished difference Result 339 states and 509 transitions. [2018-11-26 13:13:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:47,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-26 13:13:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:47,084 INFO L225 Difference]: With dead ends: 339 [2018-11-26 13:13:47,085 INFO L226 Difference]: Without dead ends: 189 [2018-11-26 13:13:47,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-26 13:13:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2018-11-26 13:13:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-26 13:13:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2018-11-26 13:13:47,098 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 63 [2018-11-26 13:13:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:47,099 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2018-11-26 13:13:47,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2018-11-26 13:13:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-26 13:13:47,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:47,101 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:13:47,102 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:47,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:47,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1519702421, now seen corresponding path program 1 times [2018-11-26 13:13:47,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:47,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:47,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:47,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:47,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:47,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:47,205 INFO L87 Difference]: Start difference. First operand 175 states and 262 transitions. Second operand 4 states. [2018-11-26 13:13:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:47,469 INFO L93 Difference]: Finished difference Result 338 states and 507 transitions. [2018-11-26 13:13:47,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:47,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-26 13:13:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:47,473 INFO L225 Difference]: With dead ends: 338 [2018-11-26 13:13:47,473 INFO L226 Difference]: Without dead ends: 188 [2018-11-26 13:13:47,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-26 13:13:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-11-26 13:13:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-26 13:13:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2018-11-26 13:13:47,483 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 63 [2018-11-26 13:13:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:47,484 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2018-11-26 13:13:47,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2018-11-26 13:13:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-26 13:13:47,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:47,485 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:47,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:47,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1612792454, now seen corresponding path program 1 times [2018-11-26 13:13:47,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:47,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:47,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:47,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:47,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:47,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:47,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:47,561 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand 4 states. [2018-11-26 13:13:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:47,788 INFO L93 Difference]: Finished difference Result 338 states and 506 transitions. [2018-11-26 13:13:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:47,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-26 13:13:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:47,790 INFO L225 Difference]: With dead ends: 338 [2018-11-26 13:13:47,791 INFO L226 Difference]: Without dead ends: 188 [2018-11-26 13:13:47,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-26 13:13:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-11-26 13:13:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-26 13:13:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 260 transitions. [2018-11-26 13:13:47,800 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 260 transitions. Word has length 64 [2018-11-26 13:13:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:47,800 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 260 transitions. [2018-11-26 13:13:47,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2018-11-26 13:13:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-26 13:13:47,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:47,801 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:47,802 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:47,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:47,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1744402129, now seen corresponding path program 1 times [2018-11-26 13:13:47,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:47,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:47,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:47,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:47,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:47,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:47,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:47,875 INFO L87 Difference]: Start difference. First operand 175 states and 260 transitions. Second operand 4 states. [2018-11-26 13:13:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:48,135 INFO L93 Difference]: Finished difference Result 338 states and 505 transitions. [2018-11-26 13:13:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:48,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-26 13:13:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:48,139 INFO L225 Difference]: With dead ends: 338 [2018-11-26 13:13:48,139 INFO L226 Difference]: Without dead ends: 188 [2018-11-26 13:13:48,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-26 13:13:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-11-26 13:13:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-26 13:13:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2018-11-26 13:13:48,147 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 65 [2018-11-26 13:13:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:48,147 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2018-11-26 13:13:48,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2018-11-26 13:13:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-26 13:13:48,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:48,148 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:48,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:48,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1864174496, now seen corresponding path program 1 times [2018-11-26 13:13:48,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:48,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:48,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:48,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:48,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:48,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:48,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:48,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:48,234 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand 4 states. [2018-11-26 13:13:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:48,504 INFO L93 Difference]: Finished difference Result 367 states and 551 transitions. [2018-11-26 13:13:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:48,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-26 13:13:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:48,507 INFO L225 Difference]: With dead ends: 367 [2018-11-26 13:13:48,507 INFO L226 Difference]: Without dead ends: 217 [2018-11-26 13:13:48,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-26 13:13:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2018-11-26 13:13:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 296 transitions. [2018-11-26 13:13:48,516 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 296 transitions. Word has length 66 [2018-11-26 13:13:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:48,516 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 296 transitions. [2018-11-26 13:13:48,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 296 transitions. [2018-11-26 13:13:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-26 13:13:48,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:48,518 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:48,518 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:48,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2082272577, now seen corresponding path program 1 times [2018-11-26 13:13:48,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:48,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:48,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:48,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:48,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:48,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:48,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:48,582 INFO L87 Difference]: Start difference. First operand 197 states and 296 transitions. Second operand 4 states. [2018-11-26 13:13:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:48,831 INFO L93 Difference]: Finished difference Result 382 states and 578 transitions. [2018-11-26 13:13:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:48,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-26 13:13:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:48,833 INFO L225 Difference]: With dead ends: 382 [2018-11-26 13:13:48,833 INFO L226 Difference]: Without dead ends: 210 [2018-11-26 13:13:48,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-26 13:13:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2018-11-26 13:13:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2018-11-26 13:13:48,843 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 66 [2018-11-26 13:13:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:48,844 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2018-11-26 13:13:48,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2018-11-26 13:13:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-26 13:13:48,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:48,845 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:48,845 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:48,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash 224292396, now seen corresponding path program 1 times [2018-11-26 13:13:48,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:48,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:48,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:48,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:48,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:48,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:48,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:48,908 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand 4 states. [2018-11-26 13:13:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:49,136 INFO L93 Difference]: Finished difference Result 372 states and 565 transitions. [2018-11-26 13:13:49,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:49,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-26 13:13:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:49,139 INFO L225 Difference]: With dead ends: 372 [2018-11-26 13:13:49,140 INFO L226 Difference]: Without dead ends: 200 [2018-11-26 13:13:49,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-26 13:13:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-11-26 13:13:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 294 transitions. [2018-11-26 13:13:49,149 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 294 transitions. Word has length 67 [2018-11-26 13:13:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:49,149 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 294 transitions. [2018-11-26 13:13:49,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 294 transitions. [2018-11-26 13:13:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-26 13:13:49,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:49,151 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:49,151 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:49,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1001313206, now seen corresponding path program 1 times [2018-11-26 13:13:49,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:49,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:49,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:49,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:49,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:49,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:49,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:49,221 INFO L87 Difference]: Start difference. First operand 197 states and 294 transitions. Second operand 4 states. [2018-11-26 13:13:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:49,644 INFO L93 Difference]: Finished difference Result 389 states and 585 transitions. [2018-11-26 13:13:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:49,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-26 13:13:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:49,647 INFO L225 Difference]: With dead ends: 389 [2018-11-26 13:13:49,648 INFO L226 Difference]: Without dead ends: 217 [2018-11-26 13:13:49,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-26 13:13:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2018-11-26 13:13:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2018-11-26 13:13:49,656 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 79 [2018-11-26 13:13:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:49,656 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2018-11-26 13:13:49,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2018-11-26 13:13:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-26 13:13:49,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:49,658 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:49,658 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:49,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1980477619, now seen corresponding path program 1 times [2018-11-26 13:13:49,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:49,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:49,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:49,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:49,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:49,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:49,791 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 4 states. [2018-11-26 13:13:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:50,139 INFO L93 Difference]: Finished difference Result 387 states and 581 transitions. [2018-11-26 13:13:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:50,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-26 13:13:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:50,142 INFO L225 Difference]: With dead ends: 387 [2018-11-26 13:13:50,142 INFO L226 Difference]: Without dead ends: 215 [2018-11-26 13:13:50,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-11-26 13:13:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2018-11-26 13:13:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 292 transitions. [2018-11-26 13:13:50,151 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 292 transitions. Word has length 80 [2018-11-26 13:13:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:50,152 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 292 transitions. [2018-11-26 13:13:50,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 292 transitions. [2018-11-26 13:13:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-26 13:13:50,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:50,153 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:13:50,153 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:50,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2048037620, now seen corresponding path program 1 times [2018-11-26 13:13:50,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:50,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:50,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:50,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:50,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:50,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:50,213 INFO L87 Difference]: Start difference. First operand 197 states and 292 transitions. Second operand 4 states. [2018-11-26 13:13:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:50,483 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2018-11-26 13:13:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:50,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-26 13:13:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:50,486 INFO L225 Difference]: With dead ends: 386 [2018-11-26 13:13:50,486 INFO L226 Difference]: Without dead ends: 214 [2018-11-26 13:13:50,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-26 13:13:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-11-26 13:13:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2018-11-26 13:13:50,494 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 80 [2018-11-26 13:13:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:50,494 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2018-11-26 13:13:50,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2018-11-26 13:13:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:13:50,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:50,495 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:50,496 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:50,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 811314439, now seen corresponding path program 1 times [2018-11-26 13:13:50,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:50,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:50,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:50,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:50,573 INFO L87 Difference]: Start difference. First operand 197 states and 291 transitions. Second operand 4 states. [2018-11-26 13:13:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:50,836 INFO L93 Difference]: Finished difference Result 386 states and 576 transitions. [2018-11-26 13:13:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:50,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-26 13:13:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:50,840 INFO L225 Difference]: With dead ends: 386 [2018-11-26 13:13:50,840 INFO L226 Difference]: Without dead ends: 214 [2018-11-26 13:13:50,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-26 13:13:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-11-26 13:13:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2018-11-26 13:13:50,848 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 81 [2018-11-26 13:13:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:50,848 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2018-11-26 13:13:50,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2018-11-26 13:13:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-26 13:13:50,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:50,849 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-26 13:13:50,849 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:50,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1626579856, now seen corresponding path program 1 times [2018-11-26 13:13:50,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:50,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:50,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:50,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:50,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:50,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:50,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:50,921 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand 4 states. [2018-11-26 13:13:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:51,187 INFO L93 Difference]: Finished difference Result 386 states and 574 transitions. [2018-11-26 13:13:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:51,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-26 13:13:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:51,189 INFO L225 Difference]: With dead ends: 386 [2018-11-26 13:13:51,190 INFO L226 Difference]: Without dead ends: 214 [2018-11-26 13:13:51,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-26 13:13:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-11-26 13:13:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2018-11-26 13:13:51,199 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 82 [2018-11-26 13:13:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:51,199 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2018-11-26 13:13:51,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2018-11-26 13:13:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-26 13:13:51,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:51,201 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:51,201 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:51,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash 661046146, now seen corresponding path program 1 times [2018-11-26 13:13:51,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:51,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:51,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:51,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:51,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:51,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:51,272 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand 4 states. [2018-11-26 13:13:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:51,511 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2018-11-26 13:13:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:51,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-26 13:13:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:51,513 INFO L225 Difference]: With dead ends: 386 [2018-11-26 13:13:51,513 INFO L226 Difference]: Without dead ends: 214 [2018-11-26 13:13:51,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-26 13:13:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-11-26 13:13:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2018-11-26 13:13:51,523 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 83 [2018-11-26 13:13:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:51,523 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2018-11-26 13:13:51,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2018-11-26 13:13:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-26 13:13:51,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:51,525 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:51,525 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:51,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash -884054005, now seen corresponding path program 1 times [2018-11-26 13:13:51,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:51,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:13:51,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:51,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:51,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:51,614 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 4 states. [2018-11-26 13:13:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:51,852 INFO L93 Difference]: Finished difference Result 376 states and 558 transitions. [2018-11-26 13:13:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:51,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-26 13:13:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:51,855 INFO L225 Difference]: With dead ends: 376 [2018-11-26 13:13:51,855 INFO L226 Difference]: Without dead ends: 204 [2018-11-26 13:13:51,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-26 13:13:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2018-11-26 13:13:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-26 13:13:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2018-11-26 13:13:51,863 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 84 [2018-11-26 13:13:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:51,864 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2018-11-26 13:13:51,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2018-11-26 13:13:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-26 13:13:51,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:51,865 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:51,865 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:51,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1973602915, now seen corresponding path program 1 times [2018-11-26 13:13:51,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:51,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:51,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:51,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:51,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:51,943 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 4 states. [2018-11-26 13:13:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:52,324 INFO L93 Difference]: Finished difference Result 477 states and 712 transitions. [2018-11-26 13:13:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:52,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-26 13:13:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:52,327 INFO L225 Difference]: With dead ends: 477 [2018-11-26 13:13:52,327 INFO L226 Difference]: Without dead ends: 305 [2018-11-26 13:13:52,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-26 13:13:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 238. [2018-11-26 13:13:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-26 13:13:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 360 transitions. [2018-11-26 13:13:52,340 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 360 transitions. Word has length 88 [2018-11-26 13:13:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:52,340 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 360 transitions. [2018-11-26 13:13:52,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 360 transitions. [2018-11-26 13:13:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-26 13:13:52,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:52,341 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:52,342 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:52,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1897717659, now seen corresponding path program 1 times [2018-11-26 13:13:52,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:52,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:52,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:52,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:52,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:52,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:52,410 INFO L87 Difference]: Start difference. First operand 238 states and 360 transitions. Second operand 4 states. [2018-11-26 13:13:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:52,730 INFO L93 Difference]: Finished difference Result 499 states and 764 transitions. [2018-11-26 13:13:52,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:52,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-26 13:13:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:52,735 INFO L225 Difference]: With dead ends: 499 [2018-11-26 13:13:52,735 INFO L226 Difference]: Without dead ends: 286 [2018-11-26 13:13:52,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-26 13:13:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2018-11-26 13:13:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-26 13:13:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2018-11-26 13:13:52,746 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 88 [2018-11-26 13:13:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:52,747 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2018-11-26 13:13:52,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2018-11-26 13:13:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-26 13:13:52,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:52,748 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:52,749 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:52,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:52,749 INFO L82 PathProgramCache]: Analyzing trace with hash -898814929, now seen corresponding path program 1 times [2018-11-26 13:13:52,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:52,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:52,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:52,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:52,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:52,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:52,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:52,851 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2018-11-26 13:13:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:53,257 INFO L93 Difference]: Finished difference Result 558 states and 855 transitions. [2018-11-26 13:13:53,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:53,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-26 13:13:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:53,260 INFO L225 Difference]: With dead ends: 558 [2018-11-26 13:13:53,261 INFO L226 Difference]: Without dead ends: 321 [2018-11-26 13:13:53,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-26 13:13:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2018-11-26 13:13:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2018-11-26 13:13:53,275 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 89 [2018-11-26 13:13:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:53,275 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2018-11-26 13:13:53,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2018-11-26 13:13:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-26 13:13:53,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:53,277 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:13:53,277 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:53,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash -444546457, now seen corresponding path program 1 times [2018-11-26 13:13:53,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:53,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:53,355 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2018-11-26 13:13:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:53,735 INFO L93 Difference]: Finished difference Result 559 states and 855 transitions. [2018-11-26 13:13:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:53,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-26 13:13:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:53,737 INFO L225 Difference]: With dead ends: 559 [2018-11-26 13:13:53,737 INFO L226 Difference]: Without dead ends: 321 [2018-11-26 13:13:53,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-26 13:13:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2018-11-26 13:13:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2018-11-26 13:13:53,749 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 101 [2018-11-26 13:13:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:53,749 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2018-11-26 13:13:53,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2018-11-26 13:13:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-26 13:13:53,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:53,750 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:13:53,751 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:53,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 431472549, now seen corresponding path program 1 times [2018-11-26 13:13:53,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:53,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:53,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:53,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:53,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:53,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:53,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:53,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:53,821 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2018-11-26 13:13:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:54,106 INFO L93 Difference]: Finished difference Result 525 states and 804 transitions. [2018-11-26 13:13:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:54,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-26 13:13:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:54,111 INFO L225 Difference]: With dead ends: 525 [2018-11-26 13:13:54,111 INFO L226 Difference]: Without dead ends: 287 [2018-11-26 13:13:54,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-26 13:13:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2018-11-26 13:13:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2018-11-26 13:13:54,123 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 101 [2018-11-26 13:13:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:54,124 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2018-11-26 13:13:54,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2018-11-26 13:13:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-26 13:13:54,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:54,125 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-26 13:13:54,125 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:54,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:54,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2060377654, now seen corresponding path program 1 times [2018-11-26 13:13:54,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:54,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:54,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:54,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:54,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:54,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:54,198 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2018-11-26 13:13:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:54,559 INFO L93 Difference]: Finished difference Result 557 states and 849 transitions. [2018-11-26 13:13:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:54,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-26 13:13:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:54,563 INFO L225 Difference]: With dead ends: 557 [2018-11-26 13:13:54,563 INFO L226 Difference]: Without dead ends: 319 [2018-11-26 13:13:54,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-26 13:13:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2018-11-26 13:13:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2018-11-26 13:13:54,576 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 102 [2018-11-26 13:13:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:54,576 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2018-11-26 13:13:54,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2018-11-26 13:13:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-26 13:13:54,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:54,577 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-26 13:13:54,578 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:54,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:54,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2127937655, now seen corresponding path program 1 times [2018-11-26 13:13:54,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:54,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:54,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:54,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:54,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:54,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:54,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:54,651 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2018-11-26 13:13:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:55,072 INFO L93 Difference]: Finished difference Result 556 states and 846 transitions. [2018-11-26 13:13:55,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:55,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-26 13:13:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:55,074 INFO L225 Difference]: With dead ends: 556 [2018-11-26 13:13:55,074 INFO L226 Difference]: Without dead ends: 318 [2018-11-26 13:13:55,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-26 13:13:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-11-26 13:13:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2018-11-26 13:13:55,085 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 102 [2018-11-26 13:13:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:55,085 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2018-11-26 13:13:55,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2018-11-26 13:13:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-26 13:13:55,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:55,087 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-26 13:13:55,087 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:55,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash -847804232, now seen corresponding path program 1 times [2018-11-26 13:13:55,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:55,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:55,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:55,160 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2018-11-26 13:13:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:55,455 INFO L93 Difference]: Finished difference Result 523 states and 796 transitions. [2018-11-26 13:13:55,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:55,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-26 13:13:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:55,458 INFO L225 Difference]: With dead ends: 523 [2018-11-26 13:13:55,460 INFO L226 Difference]: Without dead ends: 285 [2018-11-26 13:13:55,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-26 13:13:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2018-11-26 13:13:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2018-11-26 13:13:55,476 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 102 [2018-11-26 13:13:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:55,476 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2018-11-26 13:13:55,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2018-11-26 13:13:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-26 13:13:55,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:55,480 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-26 13:13:55,480 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:55,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:55,480 INFO L82 PathProgramCache]: Analyzing trace with hash -780244231, now seen corresponding path program 1 times [2018-11-26 13:13:55,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:55,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:55,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:55,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:55,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:55,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:55,557 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2018-11-26 13:13:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:55,829 INFO L93 Difference]: Finished difference Result 522 states and 793 transitions. [2018-11-26 13:13:55,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:55,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-26 13:13:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:55,831 INFO L225 Difference]: With dead ends: 522 [2018-11-26 13:13:55,831 INFO L226 Difference]: Without dead ends: 284 [2018-11-26 13:13:55,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-26 13:13:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-11-26 13:13:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2018-11-26 13:13:55,841 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 102 [2018-11-26 13:13:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:55,841 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2018-11-26 13:13:55,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2018-11-26 13:13:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-26 13:13:55,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:55,842 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:55,842 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:55,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1006751772, now seen corresponding path program 1 times [2018-11-26 13:13:55,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:55,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:55,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:55,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:55,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:55,895 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2018-11-26 13:13:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:56,225 INFO L93 Difference]: Finished difference Result 556 states and 840 transitions. [2018-11-26 13:13:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:56,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-11-26 13:13:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:56,228 INFO L225 Difference]: With dead ends: 556 [2018-11-26 13:13:56,228 INFO L226 Difference]: Without dead ends: 318 [2018-11-26 13:13:56,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-26 13:13:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-11-26 13:13:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2018-11-26 13:13:56,241 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 103 [2018-11-26 13:13:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:56,242 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2018-11-26 13:13:56,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2018-11-26 13:13:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-26 13:13:56,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:56,243 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:56,243 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:56,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:56,244 INFO L82 PathProgramCache]: Analyzing trace with hash -966077022, now seen corresponding path program 1 times [2018-11-26 13:13:56,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:56,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:56,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:56,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:56,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:56,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:56,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:56,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:56,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:56,299 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2018-11-26 13:13:56,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:56,583 INFO L93 Difference]: Finished difference Result 522 states and 789 transitions. [2018-11-26 13:13:56,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:56,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-11-26 13:13:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:56,586 INFO L225 Difference]: With dead ends: 522 [2018-11-26 13:13:56,586 INFO L226 Difference]: Without dead ends: 284 [2018-11-26 13:13:56,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-26 13:13:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-11-26 13:13:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2018-11-26 13:13:56,599 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 103 [2018-11-26 13:13:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:56,599 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2018-11-26 13:13:56,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2018-11-26 13:13:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-26 13:13:56,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:56,600 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:56,601 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:56,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2142909747, now seen corresponding path program 1 times [2018-11-26 13:13:56,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:56,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:56,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:56,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:56,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:56,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:56,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:56,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:56,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:56,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:56,664 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2018-11-26 13:13:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:57,026 INFO L93 Difference]: Finished difference Result 556 states and 836 transitions. [2018-11-26 13:13:57,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:57,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-11-26 13:13:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:57,029 INFO L225 Difference]: With dead ends: 556 [2018-11-26 13:13:57,029 INFO L226 Difference]: Without dead ends: 318 [2018-11-26 13:13:57,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-26 13:13:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-11-26 13:13:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2018-11-26 13:13:57,043 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 104 [2018-11-26 13:13:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:57,043 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2018-11-26 13:13:57,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2018-11-26 13:13:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-26 13:13:57,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:57,045 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:57,045 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:57,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -891140299, now seen corresponding path program 1 times [2018-11-26 13:13:57,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:57,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:57,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:57,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:57,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:57,115 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 4 states. [2018-11-26 13:13:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:57,397 INFO L93 Difference]: Finished difference Result 522 states and 785 transitions. [2018-11-26 13:13:57,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:57,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-11-26 13:13:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:57,400 INFO L225 Difference]: With dead ends: 522 [2018-11-26 13:13:57,400 INFO L226 Difference]: Without dead ends: 284 [2018-11-26 13:13:57,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-26 13:13:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-11-26 13:13:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 392 transitions. [2018-11-26 13:13:57,415 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 392 transitions. Word has length 104 [2018-11-26 13:13:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:57,416 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 392 transitions. [2018-11-26 13:13:57,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 392 transitions. [2018-11-26 13:13:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-26 13:13:57,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:57,417 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:57,417 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:57,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1551106847, now seen corresponding path program 1 times [2018-11-26 13:13:57,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:57,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:57,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:57,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:57,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:57,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:57,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:57,497 INFO L87 Difference]: Start difference. First operand 263 states and 392 transitions. Second operand 4 states. [2018-11-26 13:13:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:57,827 INFO L93 Difference]: Finished difference Result 556 states and 832 transitions. [2018-11-26 13:13:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:57,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-11-26 13:13:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:57,830 INFO L225 Difference]: With dead ends: 556 [2018-11-26 13:13:57,830 INFO L226 Difference]: Without dead ends: 318 [2018-11-26 13:13:57,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-26 13:13:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-11-26 13:13:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2018-11-26 13:13:57,843 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 105 [2018-11-26 13:13:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:57,843 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2018-11-26 13:13:57,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2018-11-26 13:13:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-26 13:13:57,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:57,845 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:57,845 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:57,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1984835933, now seen corresponding path program 1 times [2018-11-26 13:13:57,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:57,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:57,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:57,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:57,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:57,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:57,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:57,916 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand 4 states. [2018-11-26 13:13:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:58,173 INFO L93 Difference]: Finished difference Result 522 states and 781 transitions. [2018-11-26 13:13:58,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:58,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-11-26 13:13:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:58,176 INFO L225 Difference]: With dead ends: 522 [2018-11-26 13:13:58,176 INFO L226 Difference]: Without dead ends: 284 [2018-11-26 13:13:58,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-26 13:13:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-11-26 13:13:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2018-11-26 13:13:58,187 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 105 [2018-11-26 13:13:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:58,187 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2018-11-26 13:13:58,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2018-11-26 13:13:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-26 13:13:58,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:58,189 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:58,189 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:58,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 938023950, now seen corresponding path program 1 times [2018-11-26 13:13:58,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:58,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:58,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:58,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:58,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:58,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:58,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:58,254 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand 4 states. [2018-11-26 13:13:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:58,628 INFO L93 Difference]: Finished difference Result 546 states and 816 transitions. [2018-11-26 13:13:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:58,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-26 13:13:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:58,630 INFO L225 Difference]: With dead ends: 546 [2018-11-26 13:13:58,630 INFO L226 Difference]: Without dead ends: 308 [2018-11-26 13:13:58,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-26 13:13:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2018-11-26 13:13:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2018-11-26 13:13:58,646 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 106 [2018-11-26 13:13:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:58,647 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2018-11-26 13:13:58,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2018-11-26 13:13:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-26 13:13:58,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:58,649 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:58,649 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:58,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:58,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1498723728, now seen corresponding path program 1 times [2018-11-26 13:13:58,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:58,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:58,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:58,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:58,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:58,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:58,737 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand 4 states. [2018-11-26 13:13:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:58,986 INFO L93 Difference]: Finished difference Result 512 states and 765 transitions. [2018-11-26 13:13:58,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:58,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-26 13:13:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:58,989 INFO L225 Difference]: With dead ends: 512 [2018-11-26 13:13:58,989 INFO L226 Difference]: Without dead ends: 274 [2018-11-26 13:13:58,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-26 13:13:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2018-11-26 13:13:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2018-11-26 13:13:59,004 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 106 [2018-11-26 13:13:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:59,005 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2018-11-26 13:13:59,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2018-11-26 13:13:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-26 13:13:59,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:59,007 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:59,007 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:59,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1972686726, now seen corresponding path program 1 times [2018-11-26 13:13:59,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:59,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:59,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:59,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:59,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:59,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:59,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:59,093 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand 4 states. [2018-11-26 13:13:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:59,429 INFO L93 Difference]: Finished difference Result 546 states and 812 transitions. [2018-11-26 13:13:59,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:59,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-26 13:13:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:59,431 INFO L225 Difference]: With dead ends: 546 [2018-11-26 13:13:59,431 INFO L226 Difference]: Without dead ends: 308 [2018-11-26 13:13:59,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-26 13:13:59,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2018-11-26 13:13:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-26 13:13:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2018-11-26 13:13:59,443 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 110 [2018-11-26 13:13:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:59,443 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2018-11-26 13:13:59,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2018-11-26 13:13:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-26 13:13:59,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:59,444 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:59,445 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:59,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1904883964, now seen corresponding path program 1 times [2018-11-26 13:13:59,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:59,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:13:59,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:59,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:59,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:59,514 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand 4 states. [2018-11-26 13:13:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:13:59,800 INFO L93 Difference]: Finished difference Result 553 states and 825 transitions. [2018-11-26 13:13:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:13:59,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-26 13:13:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:13:59,803 INFO L225 Difference]: With dead ends: 553 [2018-11-26 13:13:59,803 INFO L226 Difference]: Without dead ends: 315 [2018-11-26 13:13:59,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:13:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-26 13:13:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2018-11-26 13:13:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:13:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2018-11-26 13:13:59,815 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 110 [2018-11-26 13:13:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:13:59,816 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2018-11-26 13:13:59,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:13:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2018-11-26 13:13:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-26 13:13:59,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:13:59,817 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:13:59,817 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:13:59,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:13:59,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1732378698, now seen corresponding path program 1 times [2018-11-26 13:13:59,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:13:59,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:13:59,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:13:59,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:13:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:13:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:13:59,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:13:59,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:13:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:13:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:13:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:13:59,935 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 4 states. [2018-11-26 13:14:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:00,261 INFO L93 Difference]: Finished difference Result 598 states and 900 transitions. [2018-11-26 13:14:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:00,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-11-26 13:14:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:00,264 INFO L225 Difference]: With dead ends: 598 [2018-11-26 13:14:00,264 INFO L226 Difference]: Without dead ends: 334 [2018-11-26 13:14:00,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-26 13:14:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 289. [2018-11-26 13:14:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 431 transitions. [2018-11-26 13:14:00,280 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 431 transitions. Word has length 113 [2018-11-26 13:14:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:00,281 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 431 transitions. [2018-11-26 13:14:00,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 431 transitions. [2018-11-26 13:14:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-26 13:14:00,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:00,282 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:00,282 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:00,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:00,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1392175577, now seen corresponding path program 1 times [2018-11-26 13:14:00,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:00,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:00,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:00,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:00,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:00,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:00,363 INFO L87 Difference]: Start difference. First operand 289 states and 431 transitions. Second operand 4 states. [2018-11-26 13:14:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:00,667 INFO L93 Difference]: Finished difference Result 590 states and 885 transitions. [2018-11-26 13:14:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:00,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-11-26 13:14:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:00,669 INFO L225 Difference]: With dead ends: 590 [2018-11-26 13:14:00,669 INFO L226 Difference]: Without dead ends: 326 [2018-11-26 13:14:00,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-26 13:14:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2018-11-26 13:14:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 430 transitions. [2018-11-26 13:14:00,681 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 430 transitions. Word has length 114 [2018-11-26 13:14:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:00,682 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 430 transitions. [2018-11-26 13:14:00,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 430 transitions. [2018-11-26 13:14:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-26 13:14:00,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:00,683 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:00,683 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:00,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 682577892, now seen corresponding path program 1 times [2018-11-26 13:14:00,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:00,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:00,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:00,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:00,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:00,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:00,752 INFO L87 Difference]: Start difference. First operand 289 states and 430 transitions. Second operand 4 states. [2018-11-26 13:14:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:01,081 INFO L93 Difference]: Finished difference Result 590 states and 883 transitions. [2018-11-26 13:14:01,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:01,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-11-26 13:14:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:01,084 INFO L225 Difference]: With dead ends: 590 [2018-11-26 13:14:01,084 INFO L226 Difference]: Without dead ends: 326 [2018-11-26 13:14:01,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-26 13:14:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2018-11-26 13:14:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 429 transitions. [2018-11-26 13:14:01,103 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 429 transitions. Word has length 115 [2018-11-26 13:14:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:01,104 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 429 transitions. [2018-11-26 13:14:01,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 429 transitions. [2018-11-26 13:14:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-26 13:14:01,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:01,105 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:14:01,105 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:01,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash 299610511, now seen corresponding path program 1 times [2018-11-26 13:14:01,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:01,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:01,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:01,196 INFO L87 Difference]: Start difference. First operand 289 states and 429 transitions. Second operand 4 states. [2018-11-26 13:14:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:01,507 INFO L93 Difference]: Finished difference Result 590 states and 881 transitions. [2018-11-26 13:14:01,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:01,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-11-26 13:14:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:01,510 INFO L225 Difference]: With dead ends: 590 [2018-11-26 13:14:01,510 INFO L226 Difference]: Without dead ends: 326 [2018-11-26 13:14:01,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-26 13:14:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2018-11-26 13:14:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 428 transitions. [2018-11-26 13:14:01,525 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 428 transitions. Word has length 116 [2018-11-26 13:14:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:01,525 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 428 transitions. [2018-11-26 13:14:01,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 428 transitions. [2018-11-26 13:14:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-26 13:14:01,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:01,527 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:01,527 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:01,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1458223853, now seen corresponding path program 1 times [2018-11-26 13:14:01,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:01,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:01,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:01,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:01,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:01,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:01,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:01,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:01,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:01,630 INFO L87 Difference]: Start difference. First operand 289 states and 428 transitions. Second operand 4 states. [2018-11-26 13:14:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:01,942 INFO L93 Difference]: Finished difference Result 588 states and 877 transitions. [2018-11-26 13:14:01,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:01,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-11-26 13:14:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:01,944 INFO L225 Difference]: With dead ends: 588 [2018-11-26 13:14:01,944 INFO L226 Difference]: Without dead ends: 324 [2018-11-26 13:14:01,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-26 13:14:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 289. [2018-11-26 13:14:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 427 transitions. [2018-11-26 13:14:01,958 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 427 transitions. Word has length 116 [2018-11-26 13:14:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:01,959 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 427 transitions. [2018-11-26 13:14:01,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2018-11-26 13:14:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-26 13:14:01,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:01,960 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:01,960 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:01,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:01,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1863324990, now seen corresponding path program 1 times [2018-11-26 13:14:01,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:01,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:02,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:02,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:02,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:02,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:02,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:02,035 INFO L87 Difference]: Start difference. First operand 289 states and 427 transitions. Second operand 4 states. [2018-11-26 13:14:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:02,312 INFO L93 Difference]: Finished difference Result 585 states and 871 transitions. [2018-11-26 13:14:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:02,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-11-26 13:14:02,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:02,316 INFO L225 Difference]: With dead ends: 585 [2018-11-26 13:14:02,316 INFO L226 Difference]: Without dead ends: 321 [2018-11-26 13:14:02,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-26 13:14:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 289. [2018-11-26 13:14:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2018-11-26 13:14:02,329 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 117 [2018-11-26 13:14:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:02,329 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2018-11-26 13:14:02,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2018-11-26 13:14:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-26 13:14:02,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:02,330 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:02,330 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:02,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1328178944, now seen corresponding path program 1 times [2018-11-26 13:14:02,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:02,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:02,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:02,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:02,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:02,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:02,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:02,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:02,394 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand 4 states. [2018-11-26 13:14:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:02,680 INFO L93 Difference]: Finished difference Result 583 states and 866 transitions. [2018-11-26 13:14:02,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:02,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-11-26 13:14:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:02,684 INFO L225 Difference]: With dead ends: 583 [2018-11-26 13:14:02,684 INFO L226 Difference]: Without dead ends: 319 [2018-11-26 13:14:02,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-26 13:14:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2018-11-26 13:14:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2018-11-26 13:14:02,700 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 117 [2018-11-26 13:14:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:02,700 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2018-11-26 13:14:02,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2018-11-26 13:14:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-26 13:14:02,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:02,702 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:02,702 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:02,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 200199204, now seen corresponding path program 1 times [2018-11-26 13:14:02,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:02,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:02,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:02,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:02,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:02,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:02,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:02,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:02,772 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand 4 states. [2018-11-26 13:14:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:03,086 INFO L93 Difference]: Finished difference Result 583 states and 864 transitions. [2018-11-26 13:14:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:03,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-11-26 13:14:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:03,089 INFO L225 Difference]: With dead ends: 583 [2018-11-26 13:14:03,089 INFO L226 Difference]: Without dead ends: 319 [2018-11-26 13:14:03,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-26 13:14:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2018-11-26 13:14:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 424 transitions. [2018-11-26 13:14:03,104 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 424 transitions. Word has length 119 [2018-11-26 13:14:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:03,104 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 424 transitions. [2018-11-26 13:14:03,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 424 transitions. [2018-11-26 13:14:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-26 13:14:03,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:03,105 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:03,105 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:03,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1628334344, now seen corresponding path program 1 times [2018-11-26 13:14:03,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:03,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:03,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:03,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:03,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:03,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:03,176 INFO L87 Difference]: Start difference. First operand 289 states and 424 transitions. Second operand 4 states. [2018-11-26 13:14:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:03,448 INFO L93 Difference]: Finished difference Result 579 states and 857 transitions. [2018-11-26 13:14:03,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:03,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-11-26 13:14:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:03,452 INFO L225 Difference]: With dead ends: 579 [2018-11-26 13:14:03,452 INFO L226 Difference]: Without dead ends: 315 [2018-11-26 13:14:03,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-26 13:14:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2018-11-26 13:14:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2018-11-26 13:14:03,469 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 120 [2018-11-26 13:14:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:03,470 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2018-11-26 13:14:03,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2018-11-26 13:14:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-26 13:14:03,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:03,471 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:03,471 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:03,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -982902135, now seen corresponding path program 1 times [2018-11-26 13:14:03,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:03,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:03,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:03,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:03,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:03,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:03,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:03,527 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand 4 states. [2018-11-26 13:14:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:03,802 INFO L93 Difference]: Finished difference Result 579 states and 855 transitions. [2018-11-26 13:14:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:03,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-11-26 13:14:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:03,806 INFO L225 Difference]: With dead ends: 579 [2018-11-26 13:14:03,806 INFO L226 Difference]: Without dead ends: 315 [2018-11-26 13:14:03,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-26 13:14:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2018-11-26 13:14:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2018-11-26 13:14:03,821 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 120 [2018-11-26 13:14:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:03,822 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2018-11-26 13:14:03,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2018-11-26 13:14:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-26 13:14:03,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:03,823 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:03,823 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:03,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 838983061, now seen corresponding path program 1 times [2018-11-26 13:14:03,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:03,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:03,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:03,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:03,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:03,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:03,889 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand 4 states. [2018-11-26 13:14:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:04,186 INFO L93 Difference]: Finished difference Result 577 states and 851 transitions. [2018-11-26 13:14:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:04,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-26 13:14:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:04,189 INFO L225 Difference]: With dead ends: 577 [2018-11-26 13:14:04,189 INFO L226 Difference]: Without dead ends: 313 [2018-11-26 13:14:04,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-26 13:14:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-11-26 13:14:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 421 transitions. [2018-11-26 13:14:04,207 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 421 transitions. Word has length 121 [2018-11-26 13:14:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:04,207 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 421 transitions. [2018-11-26 13:14:04,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 421 transitions. [2018-11-26 13:14:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-26 13:14:04,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:04,209 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:04,209 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:04,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1215346492, now seen corresponding path program 1 times [2018-11-26 13:14:04,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:04,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:04,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:04,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:04,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:04,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:04,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:04,279 INFO L87 Difference]: Start difference. First operand 289 states and 421 transitions. Second operand 4 states. [2018-11-26 13:14:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:04,570 INFO L93 Difference]: Finished difference Result 577 states and 849 transitions. [2018-11-26 13:14:04,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:04,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-26 13:14:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:04,574 INFO L225 Difference]: With dead ends: 577 [2018-11-26 13:14:04,574 INFO L226 Difference]: Without dead ends: 313 [2018-11-26 13:14:04,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-26 13:14:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-11-26 13:14:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 420 transitions. [2018-11-26 13:14:04,589 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 420 transitions. Word has length 122 [2018-11-26 13:14:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:04,589 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 420 transitions. [2018-11-26 13:14:04,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 420 transitions. [2018-11-26 13:14:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-26 13:14:04,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:04,590 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:04,591 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:04,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash -58479568, now seen corresponding path program 1 times [2018-11-26 13:14:04,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:04,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:04,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:04,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:04,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:04,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:04,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:04,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:04,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:04,646 INFO L87 Difference]: Start difference. First operand 289 states and 420 transitions. Second operand 4 states. [2018-11-26 13:14:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:04,930 INFO L93 Difference]: Finished difference Result 575 states and 845 transitions. [2018-11-26 13:14:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:04,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-26 13:14:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:04,934 INFO L225 Difference]: With dead ends: 575 [2018-11-26 13:14:04,934 INFO L226 Difference]: Without dead ends: 311 [2018-11-26 13:14:04,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-26 13:14:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 289. [2018-11-26 13:14:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-26 13:14:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 419 transitions. [2018-11-26 13:14:04,949 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 419 transitions. Word has length 123 [2018-11-26 13:14:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:04,950 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 419 transitions. [2018-11-26 13:14:04,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 419 transitions. [2018-11-26 13:14:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-26 13:14:04,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:04,951 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:04,951 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:04,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 53056622, now seen corresponding path program 1 times [2018-11-26 13:14:04,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:04,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:04,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-26 13:14:05,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:05,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:05,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:05,012 INFO L87 Difference]: Start difference. First operand 289 states and 419 transitions. Second operand 4 states. [2018-11-26 13:14:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:05,343 INFO L93 Difference]: Finished difference Result 624 states and 920 transitions. [2018-11-26 13:14:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:05,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-26 13:14:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:05,347 INFO L225 Difference]: With dead ends: 624 [2018-11-26 13:14:05,347 INFO L226 Difference]: Without dead ends: 360 [2018-11-26 13:14:05,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-11-26 13:14:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 321. [2018-11-26 13:14:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-26 13:14:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 476 transitions. [2018-11-26 13:14:05,363 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 476 transitions. Word has length 123 [2018-11-26 13:14:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:05,363 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 476 transitions. [2018-11-26 13:14:05,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 476 transitions. [2018-11-26 13:14:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-26 13:14:05,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:05,365 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:05,365 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:05,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash 373763920, now seen corresponding path program 1 times [2018-11-26 13:14:05,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:05,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:05,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:05,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:05,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:05,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:05,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:05,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:05,418 INFO L87 Difference]: Start difference. First operand 321 states and 476 transitions. Second operand 4 states. [2018-11-26 13:14:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:05,807 INFO L93 Difference]: Finished difference Result 723 states and 1088 transitions. [2018-11-26 13:14:05,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:05,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-26 13:14:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:05,810 INFO L225 Difference]: With dead ends: 723 [2018-11-26 13:14:05,810 INFO L226 Difference]: Without dead ends: 427 [2018-11-26 13:14:05,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-26 13:14:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 360. [2018-11-26 13:14:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-26 13:14:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2018-11-26 13:14:05,827 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 124 [2018-11-26 13:14:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:05,828 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2018-11-26 13:14:05,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2018-11-26 13:14:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-26 13:14:05,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:05,829 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:05,829 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:05,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:05,829 INFO L82 PathProgramCache]: Analyzing trace with hash 448437291, now seen corresponding path program 1 times [2018-11-26 13:14:05,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:05,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:05,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:05,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:05,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:05,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:05,885 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2018-11-26 13:14:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:06,145 INFO L93 Difference]: Finished difference Result 721 states and 1099 transitions. [2018-11-26 13:14:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:06,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-26 13:14:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:06,148 INFO L225 Difference]: With dead ends: 721 [2018-11-26 13:14:06,148 INFO L226 Difference]: Without dead ends: 386 [2018-11-26 13:14:06,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-11-26 13:14:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 360. [2018-11-26 13:14:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-26 13:14:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2018-11-26 13:14:06,165 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 125 [2018-11-26 13:14:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:06,165 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2018-11-26 13:14:06,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2018-11-26 13:14:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-26 13:14:06,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:06,166 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:06,167 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:06,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1045783778, now seen corresponding path program 1 times [2018-11-26 13:14:06,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:06,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:06,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:06,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:06,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:06,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:06,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:06,215 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand 4 states. [2018-11-26 13:14:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:06,598 INFO L93 Difference]: Finished difference Result 754 states and 1145 transitions. [2018-11-26 13:14:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:06,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-26 13:14:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:06,601 INFO L225 Difference]: With dead ends: 754 [2018-11-26 13:14:06,601 INFO L226 Difference]: Without dead ends: 419 [2018-11-26 13:14:06,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-26 13:14:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 359. [2018-11-26 13:14:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-26 13:14:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2018-11-26 13:14:06,625 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 125 [2018-11-26 13:14:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:06,625 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2018-11-26 13:14:06,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2018-11-26 13:14:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-26 13:14:06,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:06,627 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:06,627 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:06,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 9130444, now seen corresponding path program 1 times [2018-11-26 13:14:06,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:06,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:06,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:06,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:06,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:06,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:06,696 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand 4 states. [2018-11-26 13:14:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:06,980 INFO L93 Difference]: Finished difference Result 719 states and 1095 transitions. [2018-11-26 13:14:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:06,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-26 13:14:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:06,983 INFO L225 Difference]: With dead ends: 719 [2018-11-26 13:14:06,983 INFO L226 Difference]: Without dead ends: 385 [2018-11-26 13:14:06,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-11-26 13:14:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2018-11-26 13:14:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-26 13:14:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 544 transitions. [2018-11-26 13:14:07,004 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 544 transitions. Word has length 126 [2018-11-26 13:14:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:07,005 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 544 transitions. [2018-11-26 13:14:07,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 544 transitions. [2018-11-26 13:14:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-26 13:14:07,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:07,006 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:07,006 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:07,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash -171542106, now seen corresponding path program 1 times [2018-11-26 13:14:07,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:07,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:07,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:07,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:07,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:07,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:07,075 INFO L87 Difference]: Start difference. First operand 359 states and 544 transitions. Second operand 4 states. [2018-11-26 13:14:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:07,399 INFO L93 Difference]: Finished difference Result 719 states and 1093 transitions. [2018-11-26 13:14:07,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:07,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-26 13:14:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:07,402 INFO L225 Difference]: With dead ends: 719 [2018-11-26 13:14:07,402 INFO L226 Difference]: Without dead ends: 385 [2018-11-26 13:14:07,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-11-26 13:14:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2018-11-26 13:14:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-26 13:14:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2018-11-26 13:14:07,420 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 127 [2018-11-26 13:14:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2018-11-26 13:14:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2018-11-26 13:14:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-26 13:14:07,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:07,422 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:07,422 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:07,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash -924486041, now seen corresponding path program 1 times [2018-11-26 13:14:07,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:07,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:07,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:07,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:07,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:07,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:07,479 INFO L87 Difference]: Start difference. First operand 359 states and 543 transitions. Second operand 4 states. [2018-11-26 13:14:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:07,731 INFO L93 Difference]: Finished difference Result 709 states and 1079 transitions. [2018-11-26 13:14:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:07,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-26 13:14:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:07,734 INFO L225 Difference]: With dead ends: 709 [2018-11-26 13:14:07,734 INFO L226 Difference]: Without dead ends: 375 [2018-11-26 13:14:07,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-11-26 13:14:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2018-11-26 13:14:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-26 13:14:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2018-11-26 13:14:07,752 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 128 [2018-11-26 13:14:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:07,752 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2018-11-26 13:14:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2018-11-26 13:14:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-26 13:14:07,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:07,754 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:07,754 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:07,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash -629615499, now seen corresponding path program 1 times [2018-11-26 13:14:07,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:07,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:07,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:07,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:07,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:07,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:07,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:07,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:07,843 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2018-11-26 13:14:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:08,249 INFO L93 Difference]: Finished difference Result 799 states and 1220 transitions. [2018-11-26 13:14:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:08,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-11-26 13:14:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:08,252 INFO L225 Difference]: With dead ends: 799 [2018-11-26 13:14:08,252 INFO L226 Difference]: Without dead ends: 465 [2018-11-26 13:14:08,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-26 13:14:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2018-11-26 13:14:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-26 13:14:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 613 transitions. [2018-11-26 13:14:08,272 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 613 transitions. Word has length 129 [2018-11-26 13:14:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:08,273 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 613 transitions. [2018-11-26 13:14:08,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 613 transitions. [2018-11-26 13:14:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-26 13:14:08,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:08,274 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:08,274 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:08,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 5792861, now seen corresponding path program 1 times [2018-11-26 13:14:08,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:08,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:08,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:08,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:08,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:08,330 INFO L87 Difference]: Start difference. First operand 398 states and 613 transitions. Second operand 4 states. [2018-11-26 13:14:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:08,709 INFO L93 Difference]: Finished difference Result 830 states and 1279 transitions. [2018-11-26 13:14:08,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:08,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-26 13:14:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:08,712 INFO L225 Difference]: With dead ends: 830 [2018-11-26 13:14:08,712 INFO L226 Difference]: Without dead ends: 457 [2018-11-26 13:14:08,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-26 13:14:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 359. [2018-11-26 13:14:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-26 13:14:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2018-11-26 13:14:08,732 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 130 [2018-11-26 13:14:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:08,732 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2018-11-26 13:14:08,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2018-11-26 13:14:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-26 13:14:08,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:08,733 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:08,734 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:08,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:08,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1887304737, now seen corresponding path program 1 times [2018-11-26 13:14:08,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:08,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:08,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:08,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:08,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:14:08,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:08,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:08,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:08,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:08,796 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2018-11-26 13:14:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:09,069 INFO L93 Difference]: Finished difference Result 708 states and 1076 transitions. [2018-11-26 13:14:09,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:09,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-26 13:14:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:09,073 INFO L225 Difference]: With dead ends: 708 [2018-11-26 13:14:09,073 INFO L226 Difference]: Without dead ends: 374 [2018-11-26 13:14:09,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-26 13:14:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2018-11-26 13:14:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-11-26 13:14:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 545 transitions. [2018-11-26 13:14:09,093 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 545 transitions. Word has length 131 [2018-11-26 13:14:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:09,093 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 545 transitions. [2018-11-26 13:14:09,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 545 transitions. [2018-11-26 13:14:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-26 13:14:09,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:09,094 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 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-11-26 13:14:09,094 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:09,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2079412615, now seen corresponding path program 1 times [2018-11-26 13:14:09,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:09,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:09,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-26 13:14:09,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:09,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:09,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:09,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:09,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:09,144 INFO L87 Difference]: Start difference. First operand 362 states and 545 transitions. Second operand 4 states. [2018-11-26 13:14:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:09,387 INFO L93 Difference]: Finished difference Result 715 states and 1083 transitions. [2018-11-26 13:14:09,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:09,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-11-26 13:14:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:09,390 INFO L225 Difference]: With dead ends: 715 [2018-11-26 13:14:09,390 INFO L226 Difference]: Without dead ends: 378 [2018-11-26 13:14:09,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-26 13:14:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 362. [2018-11-26 13:14:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-11-26 13:14:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 544 transitions. [2018-11-26 13:14:09,410 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 544 transitions. Word has length 138 [2018-11-26 13:14:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:09,411 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 544 transitions. [2018-11-26 13:14:09,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2018-11-26 13:14:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-26 13:14:09,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:09,412 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:09,412 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:09,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:09,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1036930904, now seen corresponding path program 1 times [2018-11-26 13:14:09,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:09,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:09,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-26 13:14:09,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:09,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:09,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:09,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:09,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:09,465 INFO L87 Difference]: Start difference. First operand 362 states and 544 transitions. Second operand 4 states. [2018-11-26 13:14:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:09,787 INFO L93 Difference]: Finished difference Result 761 states and 1156 transitions. [2018-11-26 13:14:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:09,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-11-26 13:14:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:09,790 INFO L225 Difference]: With dead ends: 761 [2018-11-26 13:14:09,790 INFO L226 Difference]: Without dead ends: 424 [2018-11-26 13:14:09,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-26 13:14:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 390. [2018-11-26 13:14:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-26 13:14:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 593 transitions. [2018-11-26 13:14:09,811 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 593 transitions. Word has length 138 [2018-11-26 13:14:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:09,811 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 593 transitions. [2018-11-26 13:14:09,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 593 transitions. [2018-11-26 13:14:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-26 13:14:09,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:09,812 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 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-11-26 13:14:09,813 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:09,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1517125560, now seen corresponding path program 1 times [2018-11-26 13:14:09,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:09,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:09,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-26 13:14:09,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:09,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:09,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:09,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:09,866 INFO L87 Difference]: Start difference. First operand 390 states and 593 transitions. Second operand 4 states. [2018-11-26 13:14:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:10,153 INFO L93 Difference]: Finished difference Result 769 states and 1177 transitions. [2018-11-26 13:14:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:10,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-11-26 13:14:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:10,156 INFO L225 Difference]: With dead ends: 769 [2018-11-26 13:14:10,156 INFO L226 Difference]: Without dead ends: 404 [2018-11-26 13:14:10,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-26 13:14:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 390. [2018-11-26 13:14:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-26 13:14:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 592 transitions. [2018-11-26 13:14:10,184 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 592 transitions. Word has length 139 [2018-11-26 13:14:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:10,184 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 592 transitions. [2018-11-26 13:14:10,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 592 transitions. [2018-11-26 13:14:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-26 13:14:10,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:10,186 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 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-11-26 13:14:10,186 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:10,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:10,186 INFO L82 PathProgramCache]: Analyzing trace with hash 361739095, now seen corresponding path program 1 times [2018-11-26 13:14:10,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:10,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:10,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:10,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:10,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:10,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:10,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:10,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:10,276 INFO L87 Difference]: Start difference. First operand 390 states and 592 transitions. Second operand 4 states. [2018-11-26 13:14:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:10,631 INFO L93 Difference]: Finished difference Result 853 states and 1307 transitions. [2018-11-26 13:14:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:10,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-11-26 13:14:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:10,635 INFO L225 Difference]: With dead ends: 853 [2018-11-26 13:14:10,635 INFO L226 Difference]: Without dead ends: 488 [2018-11-26 13:14:10,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-26 13:14:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 402. [2018-11-26 13:14:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-26 13:14:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 609 transitions. [2018-11-26 13:14:10,661 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 609 transitions. Word has length 139 [2018-11-26 13:14:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:10,662 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 609 transitions. [2018-11-26 13:14:10,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 609 transitions. [2018-11-26 13:14:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-26 13:14:10,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:10,663 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 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-11-26 13:14:10,663 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:10,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1616453664, now seen corresponding path program 1 times [2018-11-26 13:14:10,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:10,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:10,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:10,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:10,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:10,715 INFO L87 Difference]: Start difference. First operand 402 states and 609 transitions. Second operand 4 states. [2018-11-26 13:14:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:11,084 INFO L93 Difference]: Finished difference Result 865 states and 1323 transitions. [2018-11-26 13:14:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:11,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-11-26 13:14:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:11,088 INFO L225 Difference]: With dead ends: 865 [2018-11-26 13:14:11,088 INFO L226 Difference]: Without dead ends: 488 [2018-11-26 13:14:11,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-26 13:14:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 403. [2018-11-26 13:14:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-26 13:14:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 610 transitions. [2018-11-26 13:14:11,111 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 610 transitions. Word has length 140 [2018-11-26 13:14:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:11,112 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 610 transitions. [2018-11-26 13:14:11,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 610 transitions. [2018-11-26 13:14:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-26 13:14:11,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:11,113 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 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-11-26 13:14:11,114 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:11,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1884129838, now seen corresponding path program 1 times [2018-11-26 13:14:11,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:11,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:11,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:11,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:11,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:11,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:11,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:11,162 INFO L87 Difference]: Start difference. First operand 403 states and 610 transitions. Second operand 4 states. [2018-11-26 13:14:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:11,530 INFO L93 Difference]: Finished difference Result 866 states and 1323 transitions. [2018-11-26 13:14:11,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:11,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-11-26 13:14:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:11,533 INFO L225 Difference]: With dead ends: 866 [2018-11-26 13:14:11,534 INFO L226 Difference]: Without dead ends: 488 [2018-11-26 13:14:11,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-26 13:14:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 404. [2018-11-26 13:14:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-11-26 13:14:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 611 transitions. [2018-11-26 13:14:11,561 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 611 transitions. Word has length 141 [2018-11-26 13:14:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:11,561 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 611 transitions. [2018-11-26 13:14:11,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 611 transitions. [2018-11-26 13:14:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-26 13:14:11,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:11,562 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 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-11-26 13:14:11,562 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:11,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1819869115, now seen corresponding path program 1 times [2018-11-26 13:14:11,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:11,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:11,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:11,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:11,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:11,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:11,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:11,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:11,610 INFO L87 Difference]: Start difference. First operand 404 states and 611 transitions. Second operand 4 states. [2018-11-26 13:14:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:11,996 INFO L93 Difference]: Finished difference Result 857 states and 1311 transitions. [2018-11-26 13:14:11,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:11,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-11-26 13:14:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:11,999 INFO L225 Difference]: With dead ends: 857 [2018-11-26 13:14:12,000 INFO L226 Difference]: Without dead ends: 478 [2018-11-26 13:14:12,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-26 13:14:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 405. [2018-11-26 13:14:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-26 13:14:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 612 transitions. [2018-11-26 13:14:12,030 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 612 transitions. Word has length 142 [2018-11-26 13:14:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:12,030 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 612 transitions. [2018-11-26 13:14:12,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 612 transitions. [2018-11-26 13:14:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-26 13:14:12,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:12,032 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:12,032 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:12,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash -413892718, now seen corresponding path program 1 times [2018-11-26 13:14:12,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:12,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:12,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:12,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:12,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:12,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:12,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:12,104 INFO L87 Difference]: Start difference. First operand 405 states and 612 transitions. Second operand 4 states. [2018-11-26 13:14:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:12,497 INFO L93 Difference]: Finished difference Result 868 states and 1323 transitions. [2018-11-26 13:14:12,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:12,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-11-26 13:14:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:12,500 INFO L225 Difference]: With dead ends: 868 [2018-11-26 13:14:12,500 INFO L226 Difference]: Without dead ends: 488 [2018-11-26 13:14:12,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-26 13:14:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2018-11-26 13:14:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-26 13:14:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 611 transitions. [2018-11-26 13:14:12,524 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 611 transitions. Word has length 144 [2018-11-26 13:14:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:12,524 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 611 transitions. [2018-11-26 13:14:12,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 611 transitions. [2018-11-26 13:14:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-26 13:14:12,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:12,526 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:12,526 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:12,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:12,526 INFO L82 PathProgramCache]: Analyzing trace with hash -953296059, now seen corresponding path program 1 times [2018-11-26 13:14:12,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:12,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:12,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:12,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:12,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:12,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:12,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:12,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:12,588 INFO L87 Difference]: Start difference. First operand 405 states and 611 transitions. Second operand 4 states. [2018-11-26 13:14:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:12,962 INFO L93 Difference]: Finished difference Result 868 states and 1321 transitions. [2018-11-26 13:14:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:12,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-11-26 13:14:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:12,966 INFO L225 Difference]: With dead ends: 868 [2018-11-26 13:14:12,966 INFO L226 Difference]: Without dead ends: 488 [2018-11-26 13:14:12,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:12,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-26 13:14:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2018-11-26 13:14:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-26 13:14:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 610 transitions. [2018-11-26 13:14:12,991 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 610 transitions. Word has length 145 [2018-11-26 13:14:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:12,991 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 610 transitions. [2018-11-26 13:14:12,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 610 transitions. [2018-11-26 13:14:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-26 13:14:12,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:12,992 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:12,992 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:12,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash 58007373, now seen corresponding path program 1 times [2018-11-26 13:14:12,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:12,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:12,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:12,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:13,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:13,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:13,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:13,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:13,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:13,049 INFO L87 Difference]: Start difference. First operand 405 states and 610 transitions. Second operand 4 states. [2018-11-26 13:14:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:13,471 INFO L93 Difference]: Finished difference Result 868 states and 1319 transitions. [2018-11-26 13:14:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:13,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-11-26 13:14:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:13,475 INFO L225 Difference]: With dead ends: 868 [2018-11-26 13:14:13,475 INFO L226 Difference]: Without dead ends: 488 [2018-11-26 13:14:13,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-26 13:14:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2018-11-26 13:14:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-26 13:14:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 609 transitions. [2018-11-26 13:14:13,500 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 609 transitions. Word has length 146 [2018-11-26 13:14:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:13,500 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 609 transitions. [2018-11-26 13:14:13,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2018-11-26 13:14:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-26 13:14:13,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:13,501 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:13,501 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:13,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1896580512, now seen corresponding path program 1 times [2018-11-26 13:14:13,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:13,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:13,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:13,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:13,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:13,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:13,551 INFO L87 Difference]: Start difference. First operand 405 states and 609 transitions. Second operand 4 states. [2018-11-26 13:14:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:13,937 INFO L93 Difference]: Finished difference Result 858 states and 1305 transitions. [2018-11-26 13:14:13,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:13,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-11-26 13:14:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:13,941 INFO L225 Difference]: With dead ends: 858 [2018-11-26 13:14:13,941 INFO L226 Difference]: Without dead ends: 478 [2018-11-26 13:14:13,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-26 13:14:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 390. [2018-11-26 13:14:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-26 13:14:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 588 transitions. [2018-11-26 13:14:13,967 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 588 transitions. Word has length 147 [2018-11-26 13:14:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:13,968 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 588 transitions. [2018-11-26 13:14:13,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 588 transitions. [2018-11-26 13:14:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-26 13:14:13,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:13,969 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2018-11-26 13:14:13,969 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:13,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1580724227, now seen corresponding path program 1 times [2018-11-26 13:14:13,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:13,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:14,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:14,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:14,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:14,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:14,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:14,020 INFO L87 Difference]: Start difference. First operand 390 states and 588 transitions. Second operand 4 states. [2018-11-26 13:14:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:14,385 INFO L93 Difference]: Finished difference Result 843 states and 1283 transitions. [2018-11-26 13:14:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:14,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-11-26 13:14:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:14,388 INFO L225 Difference]: With dead ends: 843 [2018-11-26 13:14:14,388 INFO L226 Difference]: Without dead ends: 478 [2018-11-26 13:14:14,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-26 13:14:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 418. [2018-11-26 13:14:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-11-26 13:14:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2018-11-26 13:14:14,416 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 149 [2018-11-26 13:14:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:14,416 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2018-11-26 13:14:14,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2018-11-26 13:14:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-26 13:14:14,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:14,417 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:14,418 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:14,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1765200006, now seen corresponding path program 1 times [2018-11-26 13:14:14,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:14,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:14,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:14,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:14,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:14,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:14,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:14,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:14,467 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:14,792 INFO L93 Difference]: Finished difference Result 863 states and 1314 transitions. [2018-11-26 13:14:14,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:14,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-26 13:14:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:14,795 INFO L225 Difference]: With dead ends: 863 [2018-11-26 13:14:14,795 INFO L226 Difference]: Without dead ends: 470 [2018-11-26 13:14:14,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-26 13:14:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2018-11-26 13:14:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-26 13:14:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2018-11-26 13:14:14,823 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 150 [2018-11-26 13:14:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:14,823 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2018-11-26 13:14:14,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2018-11-26 13:14:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-26 13:14:14,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:14,825 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 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-11-26 13:14:14,825 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:14,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1251319501, now seen corresponding path program 1 times [2018-11-26 13:14:14,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:14,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:14,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-26 13:14:14,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:14,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:14,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:14,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:14,884 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2018-11-26 13:14:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:15,252 INFO L93 Difference]: Finished difference Result 864 states and 1314 transitions. [2018-11-26 13:14:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:15,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-11-26 13:14:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:15,256 INFO L225 Difference]: With dead ends: 864 [2018-11-26 13:14:15,256 INFO L226 Difference]: Without dead ends: 470 [2018-11-26 13:14:15,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-26 13:14:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2018-11-26 13:14:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-26 13:14:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 633 transitions. [2018-11-26 13:14:15,284 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 633 transitions. Word has length 152 [2018-11-26 13:14:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:15,284 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 633 transitions. [2018-11-26 13:14:15,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 633 transitions. [2018-11-26 13:14:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-26 13:14:15,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:15,286 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 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-11-26 13:14:15,286 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:15,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1690606052, now seen corresponding path program 1 times [2018-11-26 13:14:15,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:15,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:15,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:15,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-26 13:14:15,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:15,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:15,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:15,334 INFO L87 Difference]: Start difference. First operand 419 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:15,675 INFO L93 Difference]: Finished difference Result 862 states and 1310 transitions. [2018-11-26 13:14:15,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:15,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-26 13:14:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:15,678 INFO L225 Difference]: With dead ends: 862 [2018-11-26 13:14:15,678 INFO L226 Difference]: Without dead ends: 468 [2018-11-26 13:14:15,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-11-26 13:14:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 419. [2018-11-26 13:14:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-26 13:14:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 632 transitions. [2018-11-26 13:14:15,713 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 632 transitions. Word has length 153 [2018-11-26 13:14:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:15,713 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 632 transitions. [2018-11-26 13:14:15,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-11-26 13:14:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-26 13:14:15,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:15,714 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:15,714 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:15,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -172955403, now seen corresponding path program 1 times [2018-11-26 13:14:15,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:15,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:15,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:15,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:15,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:15,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:15,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:15,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:15,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:15,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:15,771 INFO L87 Difference]: Start difference. First operand 419 states and 632 transitions. Second operand 4 states. [2018-11-26 13:14:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:16,107 INFO L93 Difference]: Finished difference Result 859 states and 1304 transitions. [2018-11-26 13:14:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:16,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-26 13:14:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:16,111 INFO L225 Difference]: With dead ends: 859 [2018-11-26 13:14:16,111 INFO L226 Difference]: Without dead ends: 465 [2018-11-26 13:14:16,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-26 13:14:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 422. [2018-11-26 13:14:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-26 13:14:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2018-11-26 13:14:16,141 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 153 [2018-11-26 13:14:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:16,142 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2018-11-26 13:14:16,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2018-11-26 13:14:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-26 13:14:16,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:16,143 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 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-11-26 13:14:16,143 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:16,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash -480815361, now seen corresponding path program 1 times [2018-11-26 13:14:16,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:16,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:16,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:16,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:16,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-26 13:14:16,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:16,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:16,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:16,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:16,204 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand 4 states. [2018-11-26 13:14:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:16,558 INFO L93 Difference]: Finished difference Result 853 states and 1292 transitions. [2018-11-26 13:14:16,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:16,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-26 13:14:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:16,562 INFO L225 Difference]: With dead ends: 853 [2018-11-26 13:14:16,562 INFO L226 Difference]: Without dead ends: 456 [2018-11-26 13:14:16,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-26 13:14:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2018-11-26 13:14:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-26 13:14:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 636 transitions. [2018-11-26 13:14:16,593 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 636 transitions. Word has length 153 [2018-11-26 13:14:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:16,594 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 636 transitions. [2018-11-26 13:14:16,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 636 transitions. [2018-11-26 13:14:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-26 13:14:16,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:16,595 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:16,595 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:16,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1649209736, now seen corresponding path program 1 times [2018-11-26 13:14:16,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:16,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:16,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:16,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:16,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:16,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:16,648 INFO L87 Difference]: Start difference. First operand 422 states and 636 transitions. Second operand 4 states. [2018-11-26 13:14:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:17,001 INFO L93 Difference]: Finished difference Result 875 states and 1325 transitions. [2018-11-26 13:14:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:17,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-26 13:14:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:17,003 INFO L225 Difference]: With dead ends: 875 [2018-11-26 13:14:17,004 INFO L226 Difference]: Without dead ends: 478 [2018-11-26 13:14:17,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-26 13:14:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 422. [2018-11-26 13:14:17,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-26 13:14:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 635 transitions. [2018-11-26 13:14:17,035 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 635 transitions. Word has length 154 [2018-11-26 13:14:17,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:17,035 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 635 transitions. [2018-11-26 13:14:17,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 635 transitions. [2018-11-26 13:14:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-26 13:14:17,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:17,036 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 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-11-26 13:14:17,036 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:17,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:17,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1267069304, now seen corresponding path program 1 times [2018-11-26 13:14:17,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:17,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:17,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:17,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:17,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-26 13:14:17,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:17,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:17,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:17,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:17,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:17,098 INFO L87 Difference]: Start difference. First operand 422 states and 635 transitions. Second operand 4 states. [2018-11-26 13:14:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:17,412 INFO L93 Difference]: Finished difference Result 853 states and 1288 transitions. [2018-11-26 13:14:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:17,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-26 13:14:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:17,414 INFO L225 Difference]: With dead ends: 853 [2018-11-26 13:14:17,414 INFO L226 Difference]: Without dead ends: 456 [2018-11-26 13:14:17,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-26 13:14:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2018-11-26 13:14:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-26 13:14:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 634 transitions. [2018-11-26 13:14:17,445 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 634 transitions. Word has length 154 [2018-11-26 13:14:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:17,445 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 634 transitions. [2018-11-26 13:14:17,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 634 transitions. [2018-11-26 13:14:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-26 13:14:17,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:17,446 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:17,447 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:17,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash -357850773, now seen corresponding path program 1 times [2018-11-26 13:14:17,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:17,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:17,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:17,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:17,525 INFO L87 Difference]: Start difference. First operand 422 states and 634 transitions. Second operand 4 states. [2018-11-26 13:14:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:17,896 INFO L93 Difference]: Finished difference Result 867 states and 1308 transitions. [2018-11-26 13:14:17,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:17,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-26 13:14:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:17,898 INFO L225 Difference]: With dead ends: 867 [2018-11-26 13:14:17,898 INFO L226 Difference]: Without dead ends: 470 [2018-11-26 13:14:17,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-26 13:14:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 422. [2018-11-26 13:14:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-11-26 13:14:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 633 transitions. [2018-11-26 13:14:17,930 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 633 transitions. Word has length 155 [2018-11-26 13:14:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:17,930 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 633 transitions. [2018-11-26 13:14:17,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 633 transitions. [2018-11-26 13:14:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-26 13:14:17,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:17,931 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2018-11-26 13:14:17,931 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:17,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:17,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1147734423, now seen corresponding path program 1 times [2018-11-26 13:14:17,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:17,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:17,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:17,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:17,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:17,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:17,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:17,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:17,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:17,983 INFO L87 Difference]: Start difference. First operand 422 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:18,305 INFO L93 Difference]: Finished difference Result 862 states and 1300 transitions. [2018-11-26 13:14:18,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:18,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-26 13:14:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:18,307 INFO L225 Difference]: With dead ends: 862 [2018-11-26 13:14:18,307 INFO L226 Difference]: Without dead ends: 465 [2018-11-26 13:14:18,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-26 13:14:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 423. [2018-11-26 13:14:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-11-26 13:14:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 634 transitions. [2018-11-26 13:14:18,340 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 634 transitions. Word has length 155 [2018-11-26 13:14:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:18,341 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 634 transitions. [2018-11-26 13:14:18,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 634 transitions. [2018-11-26 13:14:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-26 13:14:18,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:18,342 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 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-11-26 13:14:18,342 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:18,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:18,343 INFO L82 PathProgramCache]: Analyzing trace with hash 169856890, now seen corresponding path program 1 times [2018-11-26 13:14:18,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:18,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:18,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:18,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-26 13:14:18,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:18,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:18,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:18,397 INFO L87 Difference]: Start difference. First operand 423 states and 634 transitions. Second operand 4 states. [2018-11-26 13:14:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:18,711 INFO L93 Difference]: Finished difference Result 855 states and 1286 transitions. [2018-11-26 13:14:18,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:18,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-26 13:14:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:18,713 INFO L225 Difference]: With dead ends: 855 [2018-11-26 13:14:18,713 INFO L226 Difference]: Without dead ends: 457 [2018-11-26 13:14:18,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-26 13:14:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2018-11-26 13:14:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-11-26 13:14:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 633 transitions. [2018-11-26 13:14:18,747 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 633 transitions. Word has length 155 [2018-11-26 13:14:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:18,747 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 633 transitions. [2018-11-26 13:14:18,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 633 transitions. [2018-11-26 13:14:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-26 13:14:18,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:18,749 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2018-11-26 13:14:18,749 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:18,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1975453669, now seen corresponding path program 1 times [2018-11-26 13:14:18,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:18,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:18,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:18,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:18,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:18,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:18,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:18,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:18,820 INFO L87 Difference]: Start difference. First operand 423 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:19,146 INFO L93 Difference]: Finished difference Result 859 states and 1293 transitions. [2018-11-26 13:14:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:19,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-26 13:14:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:19,148 INFO L225 Difference]: With dead ends: 859 [2018-11-26 13:14:19,148 INFO L226 Difference]: Without dead ends: 461 [2018-11-26 13:14:19,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-26 13:14:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 424. [2018-11-26 13:14:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-26 13:14:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 634 transitions. [2018-11-26 13:14:19,182 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 634 transitions. Word has length 156 [2018-11-26 13:14:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:19,183 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 634 transitions. [2018-11-26 13:14:19,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 634 transitions. [2018-11-26 13:14:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-26 13:14:19,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:19,184 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:19,184 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:19,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1674081418, now seen corresponding path program 1 times [2018-11-26 13:14:19,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:19,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:19,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:19,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:19,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:19,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:19,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:19,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:19,243 INFO L87 Difference]: Start difference. First operand 424 states and 634 transitions. Second operand 4 states. [2018-11-26 13:14:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:19,579 INFO L93 Difference]: Finished difference Result 860 states and 1293 transitions. [2018-11-26 13:14:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:19,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-26 13:14:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:19,581 INFO L225 Difference]: With dead ends: 860 [2018-11-26 13:14:19,581 INFO L226 Difference]: Without dead ends: 461 [2018-11-26 13:14:19,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-26 13:14:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2018-11-26 13:14:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-26 13:14:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 635 transitions. [2018-11-26 13:14:19,615 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 635 transitions. Word has length 156 [2018-11-26 13:14:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:19,615 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 635 transitions. [2018-11-26 13:14:19,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 635 transitions. [2018-11-26 13:14:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-26 13:14:19,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:19,617 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 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-11-26 13:14:19,617 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:19,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:19,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1068948243, now seen corresponding path program 1 times [2018-11-26 13:14:19,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:19,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:19,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:19,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:19,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-26 13:14:19,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:19,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:19,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:19,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:19,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:19,671 INFO L87 Difference]: Start difference. First operand 425 states and 635 transitions. Second operand 4 states. [2018-11-26 13:14:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:19,976 INFO L93 Difference]: Finished difference Result 849 states and 1276 transitions. [2018-11-26 13:14:19,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:19,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-26 13:14:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:19,978 INFO L225 Difference]: With dead ends: 849 [2018-11-26 13:14:19,978 INFO L226 Difference]: Without dead ends: 449 [2018-11-26 13:14:19,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-11-26 13:14:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2018-11-26 13:14:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-26 13:14:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 634 transitions. [2018-11-26 13:14:20,012 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 634 transitions. Word has length 156 [2018-11-26 13:14:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:20,012 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 634 transitions. [2018-11-26 13:14:20,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 634 transitions. [2018-11-26 13:14:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-26 13:14:20,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:20,014 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:20,014 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:20,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1108986482, now seen corresponding path program 1 times [2018-11-26 13:14:20,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:20,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:20,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:20,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:20,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-26 13:14:20,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:20,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:20,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:20,082 INFO L87 Difference]: Start difference. First operand 425 states and 634 transitions. Second operand 4 states. [2018-11-26 13:14:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:20,483 INFO L93 Difference]: Finished difference Result 870 states and 1302 transitions. [2018-11-26 13:14:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:20,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-11-26 13:14:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:20,485 INFO L225 Difference]: With dead ends: 870 [2018-11-26 13:14:20,485 INFO L226 Difference]: Without dead ends: 470 [2018-11-26 13:14:20,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-26 13:14:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 425. [2018-11-26 13:14:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-26 13:14:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 633 transitions. [2018-11-26 13:14:20,519 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 633 transitions. Word has length 157 [2018-11-26 13:14:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:20,520 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 633 transitions. [2018-11-26 13:14:20,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 633 transitions. [2018-11-26 13:14:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-26 13:14:20,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:20,521 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:20,521 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:20,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash 887261768, now seen corresponding path program 1 times [2018-11-26 13:14:20,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:20,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:20,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:20,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:20,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:20,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:20,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:20,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:20,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:20,579 INFO L87 Difference]: Start difference. First operand 425 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:20,900 INFO L93 Difference]: Finished difference Result 859 states and 1287 transitions. [2018-11-26 13:14:20,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:20,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-11-26 13:14:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:20,903 INFO L225 Difference]: With dead ends: 859 [2018-11-26 13:14:20,903 INFO L226 Difference]: Without dead ends: 459 [2018-11-26 13:14:20,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-26 13:14:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 426. [2018-11-26 13:14:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-26 13:14:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 634 transitions. [2018-11-26 13:14:20,937 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 634 transitions. Word has length 157 [2018-11-26 13:14:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:20,937 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 634 transitions. [2018-11-26 13:14:20,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 634 transitions. [2018-11-26 13:14:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-26 13:14:20,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:20,938 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:20,938 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:20,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1573249759, now seen corresponding path program 1 times [2018-11-26 13:14:20,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:20,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:20,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:20,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-26 13:14:20,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:20,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:20,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:20,987 INFO L87 Difference]: Start difference. First operand 426 states and 634 transitions. Second operand 4 states. [2018-11-26 13:14:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:21,329 INFO L93 Difference]: Finished difference Result 869 states and 1298 transitions. [2018-11-26 13:14:21,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:21,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-11-26 13:14:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:21,331 INFO L225 Difference]: With dead ends: 869 [2018-11-26 13:14:21,331 INFO L226 Difference]: Without dead ends: 468 [2018-11-26 13:14:21,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-11-26 13:14:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 426. [2018-11-26 13:14:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-26 13:14:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2018-11-26 13:14:21,364 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 158 [2018-11-26 13:14:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:21,364 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2018-11-26 13:14:21,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2018-11-26 13:14:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-26 13:14:21,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:21,365 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:14:21,365 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:21,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash -290311696, now seen corresponding path program 1 times [2018-11-26 13:14:21,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:21,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:21,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:21,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:21,418 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:21,754 INFO L93 Difference]: Finished difference Result 866 states and 1292 transitions. [2018-11-26 13:14:21,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:21,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-11-26 13:14:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:21,755 INFO L225 Difference]: With dead ends: 866 [2018-11-26 13:14:21,755 INFO L226 Difference]: Without dead ends: 465 [2018-11-26 13:14:21,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-26 13:14:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2018-11-26 13:14:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-11-26 13:14:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 632 transitions. [2018-11-26 13:14:21,787 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 632 transitions. Word has length 158 [2018-11-26 13:14:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:21,787 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 632 transitions. [2018-11-26 13:14:21,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 632 transitions. [2018-11-26 13:14:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-26 13:14:21,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:21,788 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:21,788 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:21,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 281293425, now seen corresponding path program 1 times [2018-11-26 13:14:21,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:21,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:21,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:21,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:21,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:21,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:21,853 INFO L87 Difference]: Start difference. First operand 426 states and 632 transitions. Second operand 4 states. [2018-11-26 13:14:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:22,166 INFO L93 Difference]: Finished difference Result 860 states and 1283 transitions. [2018-11-26 13:14:22,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:22,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-11-26 13:14:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:22,169 INFO L225 Difference]: With dead ends: 860 [2018-11-26 13:14:22,169 INFO L226 Difference]: Without dead ends: 459 [2018-11-26 13:14:22,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-26 13:14:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 427. [2018-11-26 13:14:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-11-26 13:14:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 633 transitions. [2018-11-26 13:14:22,219 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 633 transitions. Word has length 158 [2018-11-26 13:14:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:22,219 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 633 transitions. [2018-11-26 13:14:22,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2018-11-26 13:14:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-26 13:14:22,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:22,223 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:22,224 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:22,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash -907282397, now seen corresponding path program 1 times [2018-11-26 13:14:22,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:22,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:22,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:22,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:22,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-26 13:14:22,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:22,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:22,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:22,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:22,304 INFO L87 Difference]: Start difference. First operand 427 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:22,627 INFO L93 Difference]: Finished difference Result 859 states and 1281 transitions. [2018-11-26 13:14:22,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:22,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-11-26 13:14:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:22,629 INFO L225 Difference]: With dead ends: 859 [2018-11-26 13:14:22,629 INFO L226 Difference]: Without dead ends: 457 [2018-11-26 13:14:22,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-26 13:14:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 428. [2018-11-26 13:14:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-26 13:14:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2018-11-26 13:14:22,667 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 159 [2018-11-26 13:14:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:22,667 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2018-11-26 13:14:22,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2018-11-26 13:14:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-26 13:14:22,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:22,668 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:14:22,669 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:22,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:22,669 INFO L82 PathProgramCache]: Analyzing trace with hash 37486546, now seen corresponding path program 1 times [2018-11-26 13:14:22,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:22,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:22,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:22,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:22,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:22,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:22,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:22,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:22,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:22,731 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand 4 states. [2018-11-26 13:14:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:23,049 INFO L93 Difference]: Finished difference Result 868 states and 1290 transitions. [2018-11-26 13:14:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:23,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-11-26 13:14:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:23,051 INFO L225 Difference]: With dead ends: 868 [2018-11-26 13:14:23,051 INFO L226 Difference]: Without dead ends: 465 [2018-11-26 13:14:23,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-26 13:14:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 428. [2018-11-26 13:14:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-26 13:14:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 633 transitions. [2018-11-26 13:14:23,093 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 633 transitions. Word has length 160 [2018-11-26 13:14:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:23,094 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 633 transitions. [2018-11-26 13:14:23,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 633 transitions. [2018-11-26 13:14:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-26 13:14:23,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:23,095 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:14:23,095 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:23,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1917507850, now seen corresponding path program 1 times [2018-11-26 13:14:23,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:23,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:23,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:23,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:23,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:23,156 INFO L87 Difference]: Start difference. First operand 428 states and 633 transitions. Second operand 4 states. [2018-11-26 13:14:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:23,485 INFO L93 Difference]: Finished difference Result 864 states and 1283 transitions. [2018-11-26 13:14:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:23,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-11-26 13:14:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:23,487 INFO L225 Difference]: With dead ends: 864 [2018-11-26 13:14:23,487 INFO L226 Difference]: Without dead ends: 461 [2018-11-26 13:14:23,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-26 13:14:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2018-11-26 13:14:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-26 13:14:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 632 transitions. [2018-11-26 13:14:23,526 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 632 transitions. Word has length 161 [2018-11-26 13:14:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:23,527 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 632 transitions. [2018-11-26 13:14:23,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 632 transitions. [2018-11-26 13:14:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-26 13:14:23,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:23,528 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:23,528 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:23,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1732027237, now seen corresponding path program 1 times [2018-11-26 13:14:23,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:23,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:23,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:23,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:23,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:23,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:23,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:23,596 INFO L87 Difference]: Start difference. First operand 428 states and 632 transitions. Second operand 4 states. [2018-11-26 13:14:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:23,952 INFO L93 Difference]: Finished difference Result 864 states and 1281 transitions. [2018-11-26 13:14:23,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:23,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-11-26 13:14:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:23,954 INFO L225 Difference]: With dead ends: 864 [2018-11-26 13:14:23,954 INFO L226 Difference]: Without dead ends: 461 [2018-11-26 13:14:23,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-11-26 13:14:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2018-11-26 13:14:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-26 13:14:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2018-11-26 13:14:23,992 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 161 [2018-11-26 13:14:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:23,993 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2018-11-26 13:14:23,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2018-11-26 13:14:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-26 13:14:23,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:23,994 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:14:23,994 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:23,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash -909058621, now seen corresponding path program 1 times [2018-11-26 13:14:23,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:23,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:23,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:23,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:23,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:24,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:24,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:24,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:24,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:24,060 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand 4 states. [2018-11-26 13:14:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:24,384 INFO L93 Difference]: Finished difference Result 862 states and 1277 transitions. [2018-11-26 13:14:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:24,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-11-26 13:14:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:24,385 INFO L225 Difference]: With dead ends: 862 [2018-11-26 13:14:24,385 INFO L226 Difference]: Without dead ends: 459 [2018-11-26 13:14:24,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-26 13:14:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2018-11-26 13:14:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-26 13:14:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 630 transitions. [2018-11-26 13:14:24,423 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 630 transitions. Word has length 162 [2018-11-26 13:14:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:24,423 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 630 transitions. [2018-11-26 13:14:24,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 630 transitions. [2018-11-26 13:14:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-26 13:14:24,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:24,425 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-11-26 13:14:24,425 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:24,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 429936214, now seen corresponding path program 1 times [2018-11-26 13:14:24,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:24,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:24,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:24,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:24,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:24,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:24,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:24,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:24,487 INFO L87 Difference]: Start difference. First operand 428 states and 630 transitions. Second operand 4 states. [2018-11-26 13:14:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:24,819 INFO L93 Difference]: Finished difference Result 862 states and 1275 transitions. [2018-11-26 13:14:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:24,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-11-26 13:14:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:24,821 INFO L225 Difference]: With dead ends: 862 [2018-11-26 13:14:24,821 INFO L226 Difference]: Without dead ends: 459 [2018-11-26 13:14:24,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-26 13:14:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2018-11-26 13:14:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-26 13:14:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 629 transitions. [2018-11-26 13:14:24,859 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 629 transitions. Word has length 163 [2018-11-26 13:14:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:24,859 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 629 transitions. [2018-11-26 13:14:24,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 629 transitions. [2018-11-26 13:14:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-26 13:14:24,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:24,860 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:24,860 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:24,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1991590309, now seen corresponding path program 1 times [2018-11-26 13:14:24,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:24,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-26 13:14:24,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:24,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:24,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:24,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:24,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:24,947 INFO L87 Difference]: Start difference. First operand 428 states and 629 transitions. Second operand 4 states. [2018-11-26 13:14:25,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:25,319 INFO L93 Difference]: Finished difference Result 897 states and 1332 transitions. [2018-11-26 13:14:25,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:25,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-11-26 13:14:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:25,321 INFO L225 Difference]: With dead ends: 897 [2018-11-26 13:14:25,321 INFO L226 Difference]: Without dead ends: 494 [2018-11-26 13:14:25,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-11-26 13:14:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 458. [2018-11-26 13:14:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-11-26 13:14:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 682 transitions. [2018-11-26 13:14:25,360 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 682 transitions. Word has length 163 [2018-11-26 13:14:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:25,361 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 682 transitions. [2018-11-26 13:14:25,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 682 transitions. [2018-11-26 13:14:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-26 13:14:25,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:25,362 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:14:25,362 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:25,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash -594323234, now seen corresponding path program 1 times [2018-11-26 13:14:25,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:25,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:25,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:25,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:25,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:25,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:25,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:25,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:25,447 INFO L87 Difference]: Start difference. First operand 458 states and 682 transitions. Second operand 4 states. [2018-11-26 13:14:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:25,791 INFO L93 Difference]: Finished difference Result 920 states and 1377 transitions. [2018-11-26 13:14:25,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:25,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-11-26 13:14:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:25,793 INFO L225 Difference]: With dead ends: 920 [2018-11-26 13:14:25,793 INFO L226 Difference]: Without dead ends: 487 [2018-11-26 13:14:25,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-11-26 13:14:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 420. [2018-11-26 13:14:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-11-26 13:14:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 626 transitions. [2018-11-26 13:14:25,839 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 626 transitions. Word has length 164 [2018-11-26 13:14:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:25,839 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 626 transitions. [2018-11-26 13:14:25,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 626 transitions. [2018-11-26 13:14:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-26 13:14:25,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:25,841 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:25,841 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:25,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash -357382928, now seen corresponding path program 1 times [2018-11-26 13:14:25,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:25,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-26 13:14:25,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:25,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:25,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:25,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:25,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:25,905 INFO L87 Difference]: Start difference. First operand 420 states and 626 transitions. Second operand 4 states. [2018-11-26 13:14:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:26,235 INFO L93 Difference]: Finished difference Result 882 states and 1320 transitions. [2018-11-26 13:14:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:26,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-11-26 13:14:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:26,237 INFO L225 Difference]: With dead ends: 882 [2018-11-26 13:14:26,238 INFO L226 Difference]: Without dead ends: 487 [2018-11-26 13:14:26,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-11-26 13:14:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 450. [2018-11-26 13:14:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-26 13:14:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 671 transitions. [2018-11-26 13:14:26,280 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 671 transitions. Word has length 166 [2018-11-26 13:14:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:26,281 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 671 transitions. [2018-11-26 13:14:26,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 671 transitions. [2018-11-26 13:14:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-26 13:14:26,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:26,282 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:26,282 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:26,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash -920966107, now seen corresponding path program 1 times [2018-11-26 13:14:26,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:26,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:26,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-26 13:14:26,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:26,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:26,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:26,362 INFO L87 Difference]: Start difference. First operand 450 states and 671 transitions. Second operand 4 states. [2018-11-26 13:14:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:26,800 INFO L93 Difference]: Finished difference Result 914 states and 1366 transitions. [2018-11-26 13:14:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:26,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-11-26 13:14:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:26,802 INFO L225 Difference]: With dead ends: 914 [2018-11-26 13:14:26,803 INFO L226 Difference]: Without dead ends: 489 [2018-11-26 13:14:26,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-11-26 13:14:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2018-11-26 13:14:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-26 13:14:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2018-11-26 13:14:26,846 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 166 [2018-11-26 13:14:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:26,847 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2018-11-26 13:14:26,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2018-11-26 13:14:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-26 13:14:26,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:26,848 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:26,849 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:26,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash 526427412, now seen corresponding path program 1 times [2018-11-26 13:14:26,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:26,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:26,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-26 13:14:26,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:26,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:26,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:26,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:26,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:26,924 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand 4 states. [2018-11-26 13:14:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:27,196 INFO L93 Difference]: Finished difference Result 888 states and 1330 transitions. [2018-11-26 13:14:27,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:27,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-11-26 13:14:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:27,198 INFO L225 Difference]: With dead ends: 888 [2018-11-26 13:14:27,198 INFO L226 Difference]: Without dead ends: 463 [2018-11-26 13:14:27,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-26 13:14:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2018-11-26 13:14:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-26 13:14:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2018-11-26 13:14:27,238 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 167 [2018-11-26 13:14:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:27,238 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2018-11-26 13:14:27,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2018-11-26 13:14:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-26 13:14:27,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:27,240 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:27,240 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:27,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash 507298066, now seen corresponding path program 1 times [2018-11-26 13:14:27,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:27,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:27,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:27,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-26 13:14:27,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:27,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:27,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:27,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:27,300 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand 4 states. [2018-11-26 13:14:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:27,662 INFO L93 Difference]: Finished difference Result 914 states and 1362 transitions. [2018-11-26 13:14:27,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:27,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-11-26 13:14:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:27,664 INFO L225 Difference]: With dead ends: 914 [2018-11-26 13:14:27,664 INFO L226 Difference]: Without dead ends: 489 [2018-11-26 13:14:27,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-11-26 13:14:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2018-11-26 13:14:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-26 13:14:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 668 transitions. [2018-11-26 13:14:27,709 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 668 transitions. Word has length 167 [2018-11-26 13:14:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:27,709 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 668 transitions. [2018-11-26 13:14:27,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 668 transitions. [2018-11-26 13:14:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-26 13:14:27,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:27,710 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:27,711 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:27,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1908215008, now seen corresponding path program 1 times [2018-11-26 13:14:27,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:27,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:27,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-26 13:14:27,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:27,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:27,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:27,768 INFO L87 Difference]: Start difference. First operand 450 states and 668 transitions. Second operand 4 states. [2018-11-26 13:14:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:28,119 INFO L93 Difference]: Finished difference Result 899 states and 1342 transitions. [2018-11-26 13:14:28,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:28,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-11-26 13:14:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:28,121 INFO L225 Difference]: With dead ends: 899 [2018-11-26 13:14:28,122 INFO L226 Difference]: Without dead ends: 474 [2018-11-26 13:14:28,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-11-26 13:14:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 450. [2018-11-26 13:14:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-26 13:14:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 667 transitions. [2018-11-26 13:14:28,161 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 667 transitions. Word has length 168 [2018-11-26 13:14:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:28,161 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 667 transitions. [2018-11-26 13:14:28,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 667 transitions. [2018-11-26 13:14:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-26 13:14:28,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:28,162 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:28,162 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:28,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -640224110, now seen corresponding path program 1 times [2018-11-26 13:14:28,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-26 13:14:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:28,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:28,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:28,288 INFO L87 Difference]: Start difference. First operand 450 states and 667 transitions. Second operand 5 states. [2018-11-26 13:14:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:28,849 INFO L93 Difference]: Finished difference Result 951 states and 1423 transitions. [2018-11-26 13:14:28,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-26 13:14:28,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2018-11-26 13:14:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:28,850 INFO L225 Difference]: With dead ends: 951 [2018-11-26 13:14:28,850 INFO L226 Difference]: Without dead ends: 526 [2018-11-26 13:14:28,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:14:28,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-11-26 13:14:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 483. [2018-11-26 13:14:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-26 13:14:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 726 transitions. [2018-11-26 13:14:28,892 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 726 transitions. Word has length 168 [2018-11-26 13:14:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:28,893 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 726 transitions. [2018-11-26 13:14:28,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 726 transitions. [2018-11-26 13:14:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-26 13:14:28,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:28,893 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:28,894 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:28,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1558397127, now seen corresponding path program 1 times [2018-11-26 13:14:28,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:28,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:28,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-26 13:14:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:28,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:28,955 INFO L87 Difference]: Start difference. First operand 483 states and 726 transitions. Second operand 4 states. [2018-11-26 13:14:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:29,248 INFO L93 Difference]: Finished difference Result 963 states and 1456 transitions. [2018-11-26 13:14:29,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:29,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-11-26 13:14:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:29,250 INFO L225 Difference]: With dead ends: 963 [2018-11-26 13:14:29,250 INFO L226 Difference]: Without dead ends: 505 [2018-11-26 13:14:29,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-26 13:14:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 483. [2018-11-26 13:14:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-26 13:14:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 725 transitions. [2018-11-26 13:14:29,295 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 725 transitions. Word has length 169 [2018-11-26 13:14:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:29,295 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 725 transitions. [2018-11-26 13:14:29,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 725 transitions. [2018-11-26 13:14:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-26 13:14:29,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:29,297 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:29,297 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:29,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1834673457, now seen corresponding path program 1 times [2018-11-26 13:14:29,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-26 13:14:29,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:29,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:29,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:29,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:29,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:29,343 INFO L87 Difference]: Start difference. First operand 483 states and 725 transitions. Second operand 3 states. [2018-11-26 13:14:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:29,456 INFO L93 Difference]: Finished difference Result 1391 states and 2109 transitions. [2018-11-26 13:14:29,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:29,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-11-26 13:14:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:29,458 INFO L225 Difference]: With dead ends: 1391 [2018-11-26 13:14:29,458 INFO L226 Difference]: Without dead ends: 933 [2018-11-26 13:14:29,459 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-11-26 13:14:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-26 13:14:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2018-11-26 13:14:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-11-26 13:14:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1401 transitions. [2018-11-26 13:14:29,553 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1401 transitions. Word has length 172 [2018-11-26 13:14:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:29,554 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1401 transitions. [2018-11-26 13:14:29,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1401 transitions. [2018-11-26 13:14:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-26 13:14:29,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:29,555 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:29,555 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:29,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash -784173615, now seen corresponding path program 1 times [2018-11-26 13:14:29,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:29,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:29,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:29,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:29,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:29,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:29,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:29,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:29,624 INFO L87 Difference]: Start difference. First operand 933 states and 1401 transitions. Second operand 3 states. [2018-11-26 13:14:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:29,820 INFO L93 Difference]: Finished difference Result 2289 states and 3456 transitions. [2018-11-26 13:14:29,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:29,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-11-26 13:14:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:29,823 INFO L225 Difference]: With dead ends: 2289 [2018-11-26 13:14:29,823 INFO L226 Difference]: Without dead ends: 1381 [2018-11-26 13:14:29,824 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-11-26 13:14:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2018-11-26 13:14:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1379. [2018-11-26 13:14:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2018-11-26 13:14:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2072 transitions. [2018-11-26 13:14:29,946 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2072 transitions. Word has length 173 [2018-11-26 13:14:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:29,947 INFO L480 AbstractCegarLoop]: Abstraction has 1379 states and 2072 transitions. [2018-11-26 13:14:29,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2072 transitions. [2018-11-26 13:14:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-26 13:14:29,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:29,948 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:14:29,948 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:29,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:29,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1650342192, now seen corresponding path program 1 times [2018-11-26 13:14:29,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:29,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:29,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:29,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-26 13:14:30,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:30,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:30,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:30,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:30,033 INFO L87 Difference]: Start difference. First operand 1379 states and 2072 transitions. Second operand 4 states. [2018-11-26 13:14:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:30,518 INFO L93 Difference]: Finished difference Result 2840 states and 4250 transitions. [2018-11-26 13:14:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:30,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-11-26 13:14:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:30,521 INFO L225 Difference]: With dead ends: 2840 [2018-11-26 13:14:30,521 INFO L226 Difference]: Without dead ends: 1486 [2018-11-26 13:14:30,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2018-11-26 13:14:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1289. [2018-11-26 13:14:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-26 13:14:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1934 transitions. [2018-11-26 13:14:30,636 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1934 transitions. Word has length 173 [2018-11-26 13:14:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:30,637 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 1934 transitions. [2018-11-26 13:14:30,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1934 transitions. [2018-11-26 13:14:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-26 13:14:30,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:30,639 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:30,639 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:30,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:30,639 INFO L82 PathProgramCache]: Analyzing trace with hash -534959922, now seen corresponding path program 1 times [2018-11-26 13:14:30,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:30,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-26 13:14:30,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:30,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:30,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:30,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:30,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:30,685 INFO L87 Difference]: Start difference. First operand 1289 states and 1934 transitions. Second operand 3 states. [2018-11-26 13:14:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:30,905 INFO L93 Difference]: Finished difference Result 2972 states and 4478 transitions. [2018-11-26 13:14:30,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:30,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-26 13:14:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:30,908 INFO L225 Difference]: With dead ends: 2972 [2018-11-26 13:14:30,909 INFO L226 Difference]: Without dead ends: 1708 [2018-11-26 13:14:30,910 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-11-26 13:14:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2018-11-26 13:14:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1702. [2018-11-26 13:14:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-11-26 13:14:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2557 transitions. [2018-11-26 13:14:31,068 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2557 transitions. Word has length 174 [2018-11-26 13:14:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:31,068 INFO L480 AbstractCegarLoop]: Abstraction has 1702 states and 2557 transitions. [2018-11-26 13:14:31,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2557 transitions. [2018-11-26 13:14:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-26 13:14:31,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:31,070 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:31,071 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:31,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash 438987165, now seen corresponding path program 1 times [2018-11-26 13:14:31,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:31,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:31,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:31,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-26 13:14:31,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:31,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:31,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:31,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:31,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:31,176 INFO L87 Difference]: Start difference. First operand 1702 states and 2557 transitions. Second operand 4 states. [2018-11-26 13:14:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:31,685 INFO L93 Difference]: Finished difference Result 3572 states and 5352 transitions. [2018-11-26 13:14:31,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:31,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-11-26 13:14:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:31,687 INFO L225 Difference]: With dead ends: 3572 [2018-11-26 13:14:31,687 INFO L226 Difference]: Without dead ends: 1895 [2018-11-26 13:14:31,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2018-11-26 13:14:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1795. [2018-11-26 13:14:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-11-26 13:14:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2695 transitions. [2018-11-26 13:14:31,848 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2695 transitions. Word has length 174 [2018-11-26 13:14:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:31,849 INFO L480 AbstractCegarLoop]: Abstraction has 1795 states and 2695 transitions. [2018-11-26 13:14:31,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2695 transitions. [2018-11-26 13:14:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-26 13:14:31,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:31,851 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:31,851 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:31,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1483011888, now seen corresponding path program 1 times [2018-11-26 13:14:31,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:31,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:31,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-26 13:14:31,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:31,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:31,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:31,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:31,892 INFO L87 Difference]: Start difference. First operand 1795 states and 2695 transitions. Second operand 3 states. [2018-11-26 13:14:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:32,073 INFO L93 Difference]: Finished difference Result 3592 states and 5399 transitions. [2018-11-26 13:14:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:32,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-26 13:14:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:32,076 INFO L225 Difference]: With dead ends: 3592 [2018-11-26 13:14:32,076 INFO L226 Difference]: Without dead ends: 1822 [2018-11-26 13:14:32,078 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-11-26 13:14:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2018-11-26 13:14:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2018-11-26 13:14:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2018-11-26 13:14:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2730 transitions. [2018-11-26 13:14:32,241 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2730 transitions. Word has length 174 [2018-11-26 13:14:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:32,241 INFO L480 AbstractCegarLoop]: Abstraction has 1822 states and 2730 transitions. [2018-11-26 13:14:32,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2730 transitions. [2018-11-26 13:14:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-26 13:14:32,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:32,244 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:32,244 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:32,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1097149486, now seen corresponding path program 1 times [2018-11-26 13:14:32,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:32,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-26 13:14:32,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:32,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:14:32,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:14:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:14:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:14:32,281 INFO L87 Difference]: Start difference. First operand 1822 states and 2730 transitions. Second operand 3 states. [2018-11-26 13:14:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:32,470 INFO L93 Difference]: Finished difference Result 3621 states and 5435 transitions. [2018-11-26 13:14:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:14:32,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-26 13:14:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:32,472 INFO L225 Difference]: With dead ends: 3621 [2018-11-26 13:14:32,472 INFO L226 Difference]: Without dead ends: 1824 [2018-11-26 13:14:32,474 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-11-26 13:14:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-11-26 13:14:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2018-11-26 13:14:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-11-26 13:14:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2732 transitions. [2018-11-26 13:14:32,654 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2732 transitions. Word has length 174 [2018-11-26 13:14:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:32,654 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2732 transitions. [2018-11-26 13:14:32,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:14:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2732 transitions. [2018-11-26 13:14:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-26 13:14:32,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:32,655 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 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-11-26 13:14:32,656 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:32,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash 845810786, now seen corresponding path program 1 times [2018-11-26 13:14:32,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:32,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:32,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:32,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:32,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:32,738 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-26 13:14:32,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:32,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:32,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:32,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:32,741 INFO L87 Difference]: Start difference. First operand 1824 states and 2732 transitions. Second operand 4 states. [2018-11-26 13:14:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:33,327 INFO L93 Difference]: Finished difference Result 3766 states and 5621 transitions. [2018-11-26 13:14:33,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:33,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-11-26 13:14:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:33,330 INFO L225 Difference]: With dead ends: 3766 [2018-11-26 13:14:33,330 INFO L226 Difference]: Without dead ends: 1969 [2018-11-26 13:14:33,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-11-26 13:14:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2018-11-26 13:14:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-11-26 13:14:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2728 transitions. [2018-11-26 13:14:33,506 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2728 transitions. Word has length 178 [2018-11-26 13:14:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:33,506 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2728 transitions. [2018-11-26 13:14:33,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2728 transitions. [2018-11-26 13:14:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-26 13:14:33,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:33,508 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 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-11-26 13:14:33,508 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:33,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:33,508 INFO L82 PathProgramCache]: Analyzing trace with hash -557193099, now seen corresponding path program 1 times [2018-11-26 13:14:33,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:33,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:33,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-26 13:14:33,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:33,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:33,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:33,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:33,583 INFO L87 Difference]: Start difference. First operand 1824 states and 2728 transitions. Second operand 4 states. [2018-11-26 13:14:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:34,174 INFO L93 Difference]: Finished difference Result 3766 states and 5613 transitions. [2018-11-26 13:14:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:34,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-11-26 13:14:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:34,177 INFO L225 Difference]: With dead ends: 3766 [2018-11-26 13:14:34,178 INFO L226 Difference]: Without dead ends: 1969 [2018-11-26 13:14:34,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-11-26 13:14:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2018-11-26 13:14:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-11-26 13:14:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2724 transitions. [2018-11-26 13:14:34,368 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2724 transitions. Word has length 179 [2018-11-26 13:14:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:34,368 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2724 transitions. [2018-11-26 13:14:34,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2724 transitions. [2018-11-26 13:14:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-26 13:14:34,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:34,370 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 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-11-26 13:14:34,370 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:34,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:34,370 INFO L82 PathProgramCache]: Analyzing trace with hash -547702755, now seen corresponding path program 1 times [2018-11-26 13:14:34,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:34,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-26 13:14:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:34,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:34,442 INFO L87 Difference]: Start difference. First operand 1824 states and 2724 transitions. Second operand 4 states. [2018-11-26 13:14:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:35,047 INFO L93 Difference]: Finished difference Result 3766 states and 5605 transitions. [2018-11-26 13:14:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:35,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-26 13:14:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:35,050 INFO L225 Difference]: With dead ends: 3766 [2018-11-26 13:14:35,050 INFO L226 Difference]: Without dead ends: 1969 [2018-11-26 13:14:35,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-11-26 13:14:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2018-11-26 13:14:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-11-26 13:14:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2720 transitions. [2018-11-26 13:14:35,242 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2720 transitions. Word has length 180 [2018-11-26 13:14:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:35,242 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2720 transitions. [2018-11-26 13:14:35,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2720 transitions. [2018-11-26 13:14:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-26 13:14:35,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:35,244 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 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-11-26 13:14:35,244 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:35,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:35,244 INFO L82 PathProgramCache]: Analyzing trace with hash 299435728, now seen corresponding path program 1 times [2018-11-26 13:14:35,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:35,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:35,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:35,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:35,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-26 13:14:35,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:35,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:35,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:35,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:35,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:35,305 INFO L87 Difference]: Start difference. First operand 1824 states and 2720 transitions. Second operand 4 states. [2018-11-26 13:14:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:35,951 INFO L93 Difference]: Finished difference Result 3726 states and 5549 transitions. [2018-11-26 13:14:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:35,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-11-26 13:14:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:35,955 INFO L225 Difference]: With dead ends: 3726 [2018-11-26 13:14:35,955 INFO L226 Difference]: Without dead ends: 1929 [2018-11-26 13:14:35,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-11-26 13:14:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1824. [2018-11-26 13:14:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-11-26 13:14:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2716 transitions. [2018-11-26 13:14:36,132 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2716 transitions. Word has length 181 [2018-11-26 13:14:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:36,132 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2716 transitions. [2018-11-26 13:14:36,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2716 transitions. [2018-11-26 13:14:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-26 13:14:36,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:36,134 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:36,134 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:36,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1232634325, now seen corresponding path program 1 times [2018-11-26 13:14:36,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:36,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:36,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-26 13:14:36,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:36,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:36,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:36,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:36,269 INFO L87 Difference]: Start difference. First operand 1824 states and 2716 transitions. Second operand 5 states. [2018-11-26 13:14:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:37,038 INFO L93 Difference]: Finished difference Result 4075 states and 6089 transitions. [2018-11-26 13:14:37,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:37,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2018-11-26 13:14:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:37,040 INFO L225 Difference]: With dead ends: 4075 [2018-11-26 13:14:37,041 INFO L226 Difference]: Without dead ends: 2278 [2018-11-26 13:14:37,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2018-11-26 13:14:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1983. [2018-11-26 13:14:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2018-11-26 13:14:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 3003 transitions. [2018-11-26 13:14:37,217 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 3003 transitions. Word has length 183 [2018-11-26 13:14:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:37,217 INFO L480 AbstractCegarLoop]: Abstraction has 1983 states and 3003 transitions. [2018-11-26 13:14:37,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 3003 transitions. [2018-11-26 13:14:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-26 13:14:37,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:37,219 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:14:37,219 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:37,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1900962557, now seen corresponding path program 1 times [2018-11-26 13:14:37,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:37,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:37,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:37,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-26 13:14:37,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:37,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:37,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:37,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:37,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:37,324 INFO L87 Difference]: Start difference. First operand 1983 states and 3003 transitions. Second operand 5 states. [2018-11-26 13:14:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:38,080 INFO L93 Difference]: Finished difference Result 4346 states and 6596 transitions. [2018-11-26 13:14:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:38,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-11-26 13:14:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:38,084 INFO L225 Difference]: With dead ends: 4346 [2018-11-26 13:14:38,084 INFO L226 Difference]: Without dead ends: 2390 [2018-11-26 13:14:38,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2018-11-26 13:14:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2091. [2018-11-26 13:14:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2018-11-26 13:14:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3223 transitions. [2018-11-26 13:14:38,281 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3223 transitions. Word has length 184 [2018-11-26 13:14:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:38,281 INFO L480 AbstractCegarLoop]: Abstraction has 2091 states and 3223 transitions. [2018-11-26 13:14:38,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3223 transitions. [2018-11-26 13:14:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-26 13:14:38,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:38,283 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:38,283 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:38,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:38,283 INFO L82 PathProgramCache]: Analyzing trace with hash -48790797, now seen corresponding path program 1 times [2018-11-26 13:14:38,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:38,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:38,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:38,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:38,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 21 proven. 303 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:14:38,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-26 13:14:38,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-26 13:14:38,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:39,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:39,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-26 13:14:39,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-26 13:14:39,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-26 13:14:39,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:14:39,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:14:39,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:14:39,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-11-26 13:14:39,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,370 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,386 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,405 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-11-26 13:14:39,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:14:39,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:14:39,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:14:39,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:14:39,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:14:39,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:14:39,648 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,673 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,691 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-11-26 13:14:39,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:14:39,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:14:39,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:14:39,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:14:39,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:14:39,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:14:39,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:39,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:39,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-11-26 13:14:39,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-11-26 13:14:39,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-11-26 13:14:39,923 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:39,974 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-11-26 13:14:39,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:14:39,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:39,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:14:40,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:14:40,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:14:40,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:14:40,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:14:40,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:40,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:40,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-11-26 13:14:40,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-11-26 13:14:40,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:40,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-11-26 13:14:40,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,307 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-11-26 13:14:40,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 202 [2018-11-26 13:14:40,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:14:40,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 82 [2018-11-26 13:14:40,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:14:40,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-26 13:14:40,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-26 13:14:40,444 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,461 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:208, output treesize:100 [2018-11-26 13:14:40,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-11-26 13:14:40,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-26 13:14:40,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:40,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:40,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-11-26 13:14:40,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:14:40,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:40,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:82 [2018-11-26 13:14:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-11-26 13:14:40,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:14:40,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2018-11-26 13:14:40,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-26 13:14:40,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-26 13:14:40,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-26 13:14:40,769 INFO L87 Difference]: Start difference. First operand 2091 states and 3223 transitions. Second operand 17 states. [2018-11-26 13:14:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:46,856 INFO L93 Difference]: Finished difference Result 10385 states and 15853 transitions. [2018-11-26 13:14:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-26 13:14:46,857 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 197 [2018-11-26 13:14:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:46,872 INFO L225 Difference]: With dead ends: 10385 [2018-11-26 13:14:46,872 INFO L226 Difference]: Without dead ends: 8321 [2018-11-26 13:14:46,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 196 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2018-11-26 13:14:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8321 states. [2018-11-26 13:14:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8321 to 2699. [2018-11-26 13:14:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-11-26 13:14:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 4231 transitions. [2018-11-26 13:14:47,173 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 4231 transitions. Word has length 197 [2018-11-26 13:14:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:47,173 INFO L480 AbstractCegarLoop]: Abstraction has 2699 states and 4231 transitions. [2018-11-26 13:14:47,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-26 13:14:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4231 transitions. [2018-11-26 13:14:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-26 13:14:47,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:47,179 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:47,179 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:47,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:47,180 INFO L82 PathProgramCache]: Analyzing trace with hash 380414431, now seen corresponding path program 1 times [2018-11-26 13:14:47,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:47,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-26 13:14:47,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:47,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:47,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:47,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:47,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:47,276 INFO L87 Difference]: Start difference. First operand 2699 states and 4231 transitions. Second operand 4 states. [2018-11-26 13:14:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:47,934 INFO L93 Difference]: Finished difference Result 5456 states and 8551 transitions. [2018-11-26 13:14:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:47,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-11-26 13:14:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:47,941 INFO L225 Difference]: With dead ends: 5456 [2018-11-26 13:14:47,941 INFO L226 Difference]: Without dead ends: 2784 [2018-11-26 13:14:47,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2018-11-26 13:14:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2699. [2018-11-26 13:14:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-11-26 13:14:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 4227 transitions. [2018-11-26 13:14:48,265 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 4227 transitions. Word has length 198 [2018-11-26 13:14:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:48,265 INFO L480 AbstractCegarLoop]: Abstraction has 2699 states and 4227 transitions. [2018-11-26 13:14:48,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4227 transitions. [2018-11-26 13:14:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-26 13:14:48,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:48,270 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:48,270 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:48,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1348782368, now seen corresponding path program 1 times [2018-11-26 13:14:48,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:48,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:48,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-26 13:14:48,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:48,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:48,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:48,391 INFO L87 Difference]: Start difference. First operand 2699 states and 4227 transitions. Second operand 4 states. [2018-11-26 13:14:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:49,046 INFO L93 Difference]: Finished difference Result 5476 states and 8563 transitions. [2018-11-26 13:14:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:49,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-11-26 13:14:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:49,053 INFO L225 Difference]: With dead ends: 5476 [2018-11-26 13:14:49,053 INFO L226 Difference]: Without dead ends: 2804 [2018-11-26 13:14:49,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2018-11-26 13:14:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2699. [2018-11-26 13:14:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-11-26 13:14:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 4223 transitions. [2018-11-26 13:14:49,315 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 4223 transitions. Word has length 205 [2018-11-26 13:14:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:49,315 INFO L480 AbstractCegarLoop]: Abstraction has 2699 states and 4223 transitions. [2018-11-26 13:14:49,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4223 transitions. [2018-11-26 13:14:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-26 13:14:49,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:49,319 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:49,319 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:49,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1548831341, now seen corresponding path program 1 times [2018-11-26 13:14:49,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:49,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:49,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:49,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-26 13:14:49,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:49,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:49,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:49,415 INFO L87 Difference]: Start difference. First operand 2699 states and 4223 transitions. Second operand 4 states. [2018-11-26 13:14:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:50,140 INFO L93 Difference]: Finished difference Result 5468 states and 8547 transitions. [2018-11-26 13:14:50,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:50,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-11-26 13:14:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:50,146 INFO L225 Difference]: With dead ends: 5468 [2018-11-26 13:14:50,146 INFO L226 Difference]: Without dead ends: 2796 [2018-11-26 13:14:50,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2018-11-26 13:14:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2699. [2018-11-26 13:14:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-11-26 13:14:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 4219 transitions. [2018-11-26 13:14:50,465 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 4219 transitions. Word has length 206 [2018-11-26 13:14:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:50,466 INFO L480 AbstractCegarLoop]: Abstraction has 2699 states and 4219 transitions. [2018-11-26 13:14:50,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4219 transitions. [2018-11-26 13:14:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-26 13:14:50,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:50,469 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:50,469 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:50,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:50,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1152197683, now seen corresponding path program 1 times [2018-11-26 13:14:50,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:50,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:50,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-26 13:14:50,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:50,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:14:50,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:14:50,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:14:50,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:50,668 INFO L87 Difference]: Start difference. First operand 2699 states and 4219 transitions. Second operand 6 states. [2018-11-26 13:14:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:51,972 INFO L93 Difference]: Finished difference Result 6264 states and 9747 transitions. [2018-11-26 13:14:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:14:51,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-11-26 13:14:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:51,979 INFO L225 Difference]: With dead ends: 6264 [2018-11-26 13:14:51,979 INFO L226 Difference]: Without dead ends: 3592 [2018-11-26 13:14:51,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:14:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2018-11-26 13:14:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2495. [2018-11-26 13:14:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2018-11-26 13:14:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3891 transitions. [2018-11-26 13:14:52,203 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3891 transitions. Word has length 210 [2018-11-26 13:14:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:52,203 INFO L480 AbstractCegarLoop]: Abstraction has 2495 states and 3891 transitions. [2018-11-26 13:14:52,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:14:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3891 transitions. [2018-11-26 13:14:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-26 13:14:52,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:52,206 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:52,206 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:52,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash -946978016, now seen corresponding path program 1 times [2018-11-26 13:14:52,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:52,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:52,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-26 13:14:52,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:52,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:14:52,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:14:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:14:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:52,387 INFO L87 Difference]: Start difference. First operand 2495 states and 3891 transitions. Second operand 6 states. [2018-11-26 13:14:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:53,869 INFO L93 Difference]: Finished difference Result 5540 states and 8579 transitions. [2018-11-26 13:14:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:14:53,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-11-26 13:14:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:53,873 INFO L225 Difference]: With dead ends: 5540 [2018-11-26 13:14:53,874 INFO L226 Difference]: Without dead ends: 3072 [2018-11-26 13:14:53,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:14:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-11-26 13:14:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2499. [2018-11-26 13:14:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2499 states. [2018-11-26 13:14:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3887 transitions. [2018-11-26 13:14:54,115 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3887 transitions. Word has length 211 [2018-11-26 13:14:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:54,115 INFO L480 AbstractCegarLoop]: Abstraction has 2499 states and 3887 transitions. [2018-11-26 13:14:54,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:14:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3887 transitions. [2018-11-26 13:14:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-26 13:14:54,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:54,118 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:54,118 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:54,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash -764304234, now seen corresponding path program 1 times [2018-11-26 13:14:54,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:54,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:54,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:54,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-26 13:14:54,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:54,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:54,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:54,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:54,295 INFO L87 Difference]: Start difference. First operand 2499 states and 3887 transitions. Second operand 5 states. [2018-11-26 13:14:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:55,238 INFO L93 Difference]: Finished difference Result 5506 states and 8564 transitions. [2018-11-26 13:14:55,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:55,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-11-26 13:14:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:55,244 INFO L225 Difference]: With dead ends: 5506 [2018-11-26 13:14:55,244 INFO L226 Difference]: Without dead ends: 3034 [2018-11-26 13:14:55,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2018-11-26 13:14:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2647. [2018-11-26 13:14:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-11-26 13:14:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4147 transitions. [2018-11-26 13:14:55,483 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 4147 transitions. Word has length 217 [2018-11-26 13:14:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:55,484 INFO L480 AbstractCegarLoop]: Abstraction has 2647 states and 4147 transitions. [2018-11-26 13:14:55,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 4147 transitions. [2018-11-26 13:14:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-26 13:14:55,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:55,487 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:55,487 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:55,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1038928542, now seen corresponding path program 1 times [2018-11-26 13:14:55,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:55,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-26 13:14:55,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:55,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:14:55,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:14:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:14:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:55,652 INFO L87 Difference]: Start difference. First operand 2647 states and 4147 transitions. Second operand 5 states. [2018-11-26 13:14:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:56,661 INFO L93 Difference]: Finished difference Result 5642 states and 8800 transitions. [2018-11-26 13:14:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:56,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2018-11-26 13:14:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:56,666 INFO L225 Difference]: With dead ends: 5642 [2018-11-26 13:14:56,666 INFO L226 Difference]: Without dead ends: 3022 [2018-11-26 13:14:56,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:14:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2018-11-26 13:14:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 2639. [2018-11-26 13:14:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2018-11-26 13:14:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4131 transitions. [2018-11-26 13:14:56,937 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4131 transitions. Word has length 218 [2018-11-26 13:14:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:56,937 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 4131 transitions. [2018-11-26 13:14:56,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:14:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4131 transitions. [2018-11-26 13:14:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-26 13:14:56,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:56,941 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 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-11-26 13:14:56,941 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:56,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:56,941 INFO L82 PathProgramCache]: Analyzing trace with hash -525285604, now seen corresponding path program 1 times [2018-11-26 13:14:56,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:56,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:56,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-26 13:14:57,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:14:57,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:14:57,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:14:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:14:57,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:14:57,039 INFO L87 Difference]: Start difference. First operand 2639 states and 4131 transitions. Second operand 4 states. [2018-11-26 13:14:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:14:57,795 INFO L93 Difference]: Finished difference Result 5344 states and 8359 transitions. [2018-11-26 13:14:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:14:57,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-11-26 13:14:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:14:57,801 INFO L225 Difference]: With dead ends: 5344 [2018-11-26 13:14:57,801 INFO L226 Difference]: Without dead ends: 2732 [2018-11-26 13:14:57,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:14:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2018-11-26 13:14:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2639. [2018-11-26 13:14:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2018-11-26 13:14:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4127 transitions. [2018-11-26 13:14:58,042 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4127 transitions. Word has length 223 [2018-11-26 13:14:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:14:58,042 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 4127 transitions. [2018-11-26 13:14:58,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:14:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4127 transitions. [2018-11-26 13:14:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-26 13:14:58,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:14:58,045 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:14:58,045 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:14:58,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:14:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash -6157552, now seen corresponding path program 1 times [2018-11-26 13:14:58,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:14:58,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:14:58,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:58,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:58,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:14:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-11-26 13:14:58,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-26 13:14:58,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-26 13:14:58,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:14:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:14:58,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:14:58,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-26 13:14:58,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-26 13:14:58,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-11-26 13:14:58,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-11-26 13:14:58,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-11-26 13:14:58,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-11-26 13:14:58,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2018-11-26 13:14:58,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-11-26 13:14:58,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 24 [2018-11-26 13:14:58,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-26 13:14:58,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-11-26 13:14:58,501 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,509 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-11-26 13:14:58,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-26 13:14:58,515 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,522 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:14:58,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-26 13:14:58,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2018-11-26 13:14:58,527 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,533 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-11-26 13:14:58,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:14:58,572 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-11-26 13:14:58,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-11-26 13:14:58,588 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,591 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,595 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-11-26 13:14:58,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-26 13:14:58,626 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-11-26 13:14:58,670 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-11-26 13:14:58,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:14:58,724 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,729 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 61 [2018-11-26 13:14:58,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2018-11-26 13:14:58,783 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:14:58,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-11-26 13:14:58,809 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,819 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,833 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:14:58,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:14:58,838 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,840 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:14:58,850 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-11-26 13:14:58,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:14:58,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:14:58,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:14:58,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:14:58,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:14:58,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:14:58,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-11-26 13:14:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 276 proven. 17 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-11-26 13:14:58,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-26 13:14:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-26 13:14:58,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-26 13:14:58,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-26 13:14:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-26 13:14:58,944 INFO L87 Difference]: Start difference. First operand 2639 states and 4127 transitions. Second operand 11 states. [2018-11-26 13:15:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:01,592 INFO L93 Difference]: Finished difference Result 6335 states and 9774 transitions. [2018-11-26 13:15:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-26 13:15:01,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 225 [2018-11-26 13:15:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:01,598 INFO L225 Difference]: With dead ends: 6335 [2018-11-26 13:15:01,598 INFO L226 Difference]: Without dead ends: 3723 [2018-11-26 13:15:01,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-11-26 13:15:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2018-11-26 13:15:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 2703. [2018-11-26 13:15:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-11-26 13:15:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 4209 transitions. [2018-11-26 13:15:01,842 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 4209 transitions. Word has length 225 [2018-11-26 13:15:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:01,842 INFO L480 AbstractCegarLoop]: Abstraction has 2703 states and 4209 transitions. [2018-11-26 13:15:01,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-26 13:15:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 4209 transitions. [2018-11-26 13:15:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-26 13:15:01,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:01,845 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:15:01,845 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:01,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash 159347792, now seen corresponding path program 1 times [2018-11-26 13:15:01,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:01,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:01,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:01,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 319 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-26 13:15:01,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-26 13:15:01,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-26 13:15:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:02,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:15:02,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-26 13:15:02,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-26 13:15:02,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-11-26 13:15:02,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-11-26 13:15:02,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:15:02,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-26 13:15:02,196 INFO L683 Elim1Store]: detected equality via solver [2018-11-26 13:15:02,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-11-26 13:15:02,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-11-26 13:15:02,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:15:02,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 80 [2018-11-26 13:15:02,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2018-11-26 13:15:02,238 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,242 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,247 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2018-11-26 13:15:02,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-11-26 13:15:02,274 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 90 [2018-11-26 13:15:02,318 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2018-11-26 13:15:02,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2018-11-26 13:15:02,372 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,379 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 109 [2018-11-26 13:15:02,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-11-26 13:15:02,443 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:02,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-11-26 13:15:02,478 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,490 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,508 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-26 13:15:02,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-11-26 13:15:02,529 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,534 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-26 13:15:02,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-11-26 13:15:02,540 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,542 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-26 13:15:02,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-11-26 13:15:02,559 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,560 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:15:02,567 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-11-26 13:15:02,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:15:02,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:15:02,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:15:02,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:15:02,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:02,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:15:02,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-11-26 13:15:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 286 proven. 13 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-26 13:15:02,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-26 13:15:02,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-26 13:15:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-26 13:15:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-26 13:15:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-26 13:15:02,662 INFO L87 Difference]: Start difference. First operand 2703 states and 4209 transitions. Second operand 11 states. [2018-11-26 13:15:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:05,208 INFO L93 Difference]: Finished difference Result 6351 states and 9774 transitions. [2018-11-26 13:15:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-26 13:15:05,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 227 [2018-11-26 13:15:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:05,213 INFO L225 Difference]: With dead ends: 6351 [2018-11-26 13:15:05,213 INFO L226 Difference]: Without dead ends: 3675 [2018-11-26 13:15:05,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-11-26 13:15:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2018-11-26 13:15:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 2703. [2018-11-26 13:15:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-11-26 13:15:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 4187 transitions. [2018-11-26 13:15:05,491 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 4187 transitions. Word has length 227 [2018-11-26 13:15:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:05,491 INFO L480 AbstractCegarLoop]: Abstraction has 2703 states and 4187 transitions. [2018-11-26 13:15:05,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-26 13:15:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 4187 transitions. [2018-11-26 13:15:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-26 13:15:05,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:05,494 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:05,494 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:05,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:05,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1711019319, now seen corresponding path program 1 times [2018-11-26 13:15:05,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:05,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:05,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:05,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:05,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-26 13:15:05,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:05,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:15:05,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:15:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:15:05,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:15:05,593 INFO L87 Difference]: Start difference. First operand 2703 states and 4187 transitions. Second operand 4 states. [2018-11-26 13:15:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:06,233 INFO L93 Difference]: Finished difference Result 5515 states and 8510 transitions. [2018-11-26 13:15:06,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:06,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-11-26 13:15:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:06,238 INFO L225 Difference]: With dead ends: 5515 [2018-11-26 13:15:06,238 INFO L226 Difference]: Without dead ends: 2839 [2018-11-26 13:15:06,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2018-11-26 13:15:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2746. [2018-11-26 13:15:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2746 states. [2018-11-26 13:15:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 4238 transitions. [2018-11-26 13:15:06,499 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 4238 transitions. Word has length 228 [2018-11-26 13:15:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:06,500 INFO L480 AbstractCegarLoop]: Abstraction has 2746 states and 4238 transitions. [2018-11-26 13:15:06,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:15:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 4238 transitions. [2018-11-26 13:15:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-26 13:15:06,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:06,502 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:06,502 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:06,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash 602895087, now seen corresponding path program 1 times [2018-11-26 13:15:06,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:06,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:06,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-26 13:15:06,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:06,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:15:06,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:15:06,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:15:06,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:15:06,593 INFO L87 Difference]: Start difference. First operand 2746 states and 4238 transitions. Second operand 4 states. [2018-11-26 13:15:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:07,228 INFO L93 Difference]: Finished difference Result 5538 states and 8533 transitions. [2018-11-26 13:15:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:07,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2018-11-26 13:15:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:07,232 INFO L225 Difference]: With dead ends: 5538 [2018-11-26 13:15:07,232 INFO L226 Difference]: Without dead ends: 2811 [2018-11-26 13:15:07,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2018-11-26 13:15:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2742. [2018-11-26 13:15:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2742 states. [2018-11-26 13:15:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 4230 transitions. [2018-11-26 13:15:07,473 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 4230 transitions. Word has length 229 [2018-11-26 13:15:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:07,473 INFO L480 AbstractCegarLoop]: Abstraction has 2742 states and 4230 transitions. [2018-11-26 13:15:07,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:15:07,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4230 transitions. [2018-11-26 13:15:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-26 13:15:07,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:07,476 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:07,476 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:07,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash 991606643, now seen corresponding path program 1 times [2018-11-26 13:15:07,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:07,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-26 13:15:07,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:07,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:15:07,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:15:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:15:07,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:07,659 INFO L87 Difference]: Start difference. First operand 2742 states and 4230 transitions. Second operand 5 states. [2018-11-26 13:15:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:08,593 INFO L93 Difference]: Finished difference Result 5844 states and 8978 transitions. [2018-11-26 13:15:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:08,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2018-11-26 13:15:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:08,598 INFO L225 Difference]: With dead ends: 5844 [2018-11-26 13:15:08,598 INFO L226 Difference]: Without dead ends: 3129 [2018-11-26 13:15:08,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:15:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2018-11-26 13:15:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 2766. [2018-11-26 13:15:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2018-11-26 13:15:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4262 transitions. [2018-11-26 13:15:08,842 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4262 transitions. Word has length 231 [2018-11-26 13:15:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:08,842 INFO L480 AbstractCegarLoop]: Abstraction has 2766 states and 4262 transitions. [2018-11-26 13:15:08,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:15:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4262 transitions. [2018-11-26 13:15:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-11-26 13:15:08,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:08,846 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:08,846 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:08,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:08,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1515046011, now seen corresponding path program 1 times [2018-11-26 13:15:08,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:08,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:08,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-26 13:15:08,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:08,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:15:08,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:15:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:15:08,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:08,971 INFO L87 Difference]: Start difference. First operand 2766 states and 4262 transitions. Second operand 5 states. [2018-11-26 13:15:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:09,825 INFO L93 Difference]: Finished difference Result 5871 states and 9018 transitions. [2018-11-26 13:15:09,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:09,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 232 [2018-11-26 13:15:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:09,830 INFO L225 Difference]: With dead ends: 5871 [2018-11-26 13:15:09,830 INFO L226 Difference]: Without dead ends: 3124 [2018-11-26 13:15:09,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:15:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2018-11-26 13:15:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 2747. [2018-11-26 13:15:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-11-26 13:15:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 4241 transitions. [2018-11-26 13:15:10,075 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 4241 transitions. Word has length 232 [2018-11-26 13:15:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:10,075 INFO L480 AbstractCegarLoop]: Abstraction has 2747 states and 4241 transitions. [2018-11-26 13:15:10,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:15:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 4241 transitions. [2018-11-26 13:15:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-26 13:15:10,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:10,078 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:15:10,079 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:10,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1784659630, now seen corresponding path program 2 times [2018-11-26 13:15:10,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:10,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:10,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 61 proven. 380 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-26 13:15:10,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-26 13:15:10,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-26 13:15:10,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-26 13:15:11,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-26 13:15:11,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-26 13:15:11,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:15:11,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-26 13:15:11,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-26 13:15:11,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-26 13:15:11,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:15:11,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:15:11,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:15:11,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-11-26 13:15:11,233 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,243 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,248 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,273 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:60, output treesize:82 [2018-11-26 13:15:11,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:11,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:11,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:11,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:11,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 64 [2018-11-26 13:15:11,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 84 [2018-11-26 13:15:11,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 114 [2018-11-26 13:15:11,512 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,557 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,594 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:121, output treesize:64 [2018-11-26 13:15:11,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:11,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:11,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:64 [2018-11-26 13:15:11,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:11,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:11,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:64 [2018-11-26 13:15:11,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:11,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:11,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:11,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:11,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:64 [2018-11-26 13:15:11,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:11,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:11,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:64 [2018-11-26 13:15:11,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:11,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:11,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:64 [2018-11-26 13:15:11,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:11,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:11,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 64 [2018-11-26 13:15:11,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 84 [2018-11-26 13:15:11,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:11,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 114 [2018-11-26 13:15:11,957 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:11,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,005 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:102, output treesize:64 [2018-11-26 13:15:12,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-11-26 13:15:12,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-26 13:15:12,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:12,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:12,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2018-11-26 13:15:12,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-26 13:15:12,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:64 [2018-11-26 13:15:12,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:12,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:12,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:12,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:12,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,167 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:64 [2018-11-26 13:15:12,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-11-26 13:15:12,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-26 13:15:12,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:12,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:12,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2018-11-26 13:15:12,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-26 13:15:12,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:64 [2018-11-26 13:15:12,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:12,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:12,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-11-26 13:15:12,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:15:12,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-11-26 13:15:12,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-26 13:15:12,425 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-11-26 13:15:12,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:15:12,467 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,501 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2018-11-26 13:15:12,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-26 13:15:12,604 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 110 [2018-11-26 13:15:12,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 100 [2018-11-26 13:15:12,643 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,658 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,667 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-11-26 13:15:12,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-26 13:15:12,749 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,769 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 156 [2018-11-26 13:15:12,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:15:12,824 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,843 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 97 [2018-11-26 13:15:12,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,884 INFO L683 Elim1Store]: detected equality via solver [2018-11-26 13:15:12,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:12,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 146 [2018-11-26 13:15:12,895 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,922 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:12,947 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:328, output treesize:109 [2018-11-26 13:15:13,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:13,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 100 [2018-11-26 13:15:13,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:13,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:13,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:13,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 105 [2018-11-26 13:15:13,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:13,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:13,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2018-11-26 13:15:13,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-11-26 13:15:13,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:13,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:13,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-26 13:15:13,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-26 13:15:13,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:13,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:13,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:13,105 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:140, output treesize:41 [2018-11-26 13:15:13,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-26 13:15:13,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:13,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-26 13:15:13,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:13,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:15:13,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:13,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:13,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:13,183 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2018-11-26 13:15:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 351 proven. 63 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-26 13:15:13,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-26 13:15:13,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-11-26 13:15:13,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-26 13:15:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-26 13:15:13,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-11-26 13:15:13,533 INFO L87 Difference]: Start difference. First operand 2747 states and 4241 transitions. Second operand 19 states. [2018-11-26 13:15:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:24,664 INFO L93 Difference]: Finished difference Result 14972 states and 22495 transitions. [2018-11-26 13:15:24,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-26 13:15:24,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 239 [2018-11-26 13:15:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:24,680 INFO L225 Difference]: With dead ends: 14972 [2018-11-26 13:15:24,680 INFO L226 Difference]: Without dead ends: 12252 [2018-11-26 13:15:24,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 237 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-11-26 13:15:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12252 states. [2018-11-26 13:15:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12252 to 2800. [2018-11-26 13:15:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2018-11-26 13:15:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 4323 transitions. [2018-11-26 13:15:25,081 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 4323 transitions. Word has length 239 [2018-11-26 13:15:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:25,082 INFO L480 AbstractCegarLoop]: Abstraction has 2800 states and 4323 transitions. [2018-11-26 13:15:25,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-26 13:15:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 4323 transitions. [2018-11-26 13:15:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-26 13:15:25,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:25,085 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:25,085 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:25,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1389372553, now seen corresponding path program 1 times [2018-11-26 13:15:25,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:25,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:25,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:25,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-26 13:15:25,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-26 13:15:25,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:25,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:15:25,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:15:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:15:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:15:25,200 INFO L87 Difference]: Start difference. First operand 2800 states and 4323 transitions. Second operand 4 states. [2018-11-26 13:15:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:26,003 INFO L93 Difference]: Finished difference Result 5730 states and 8819 transitions. [2018-11-26 13:15:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:26,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2018-11-26 13:15:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:26,007 INFO L225 Difference]: With dead ends: 5730 [2018-11-26 13:15:26,007 INFO L226 Difference]: Without dead ends: 2957 [2018-11-26 13:15:26,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2018-11-26 13:15:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2800. [2018-11-26 13:15:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2018-11-26 13:15:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 4311 transitions. [2018-11-26 13:15:26,303 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 4311 transitions. Word has length 251 [2018-11-26 13:15:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:26,303 INFO L480 AbstractCegarLoop]: Abstraction has 2800 states and 4311 transitions. [2018-11-26 13:15:26,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:15:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 4311 transitions. [2018-11-26 13:15:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-26 13:15:26,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:26,306 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:26,306 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:26,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1242930652, now seen corresponding path program 1 times [2018-11-26 13:15:26,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:26,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:26,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-11-26 13:15:26,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:26,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:15:26,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:15:26,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:15:26,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:26,434 INFO L87 Difference]: Start difference. First operand 2800 states and 4311 transitions. Second operand 5 states. [2018-11-26 13:15:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:27,413 INFO L93 Difference]: Finished difference Result 6006 states and 9220 transitions. [2018-11-26 13:15:27,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:27,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2018-11-26 13:15:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:27,418 INFO L225 Difference]: With dead ends: 6006 [2018-11-26 13:15:27,418 INFO L226 Difference]: Without dead ends: 3233 [2018-11-26 13:15:27,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:15:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-11-26 13:15:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 2940. [2018-11-26 13:15:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2940 states. [2018-11-26 13:15:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 4543 transitions. [2018-11-26 13:15:27,753 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 4543 transitions. Word has length 252 [2018-11-26 13:15:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:27,753 INFO L480 AbstractCegarLoop]: Abstraction has 2940 states and 4543 transitions. [2018-11-26 13:15:27,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:15:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4543 transitions. [2018-11-26 13:15:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-26 13:15:27,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:27,756 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:15:27,756 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:27,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:27,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1877873660, now seen corresponding path program 1 times [2018-11-26 13:15:27,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:27,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:27,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:27,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-11-26 13:15:27,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:27,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:15:27,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:15:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:15:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:27,919 INFO L87 Difference]: Start difference. First operand 2940 states and 4543 transitions. Second operand 5 states. [2018-11-26 13:15:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:28,821 INFO L93 Difference]: Finished difference Result 6112 states and 9398 transitions. [2018-11-26 13:15:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:28,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2018-11-26 13:15:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:28,825 INFO L225 Difference]: With dead ends: 6112 [2018-11-26 13:15:28,825 INFO L226 Difference]: Without dead ends: 3199 [2018-11-26 13:15:28,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:15:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2018-11-26 13:15:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 2932. [2018-11-26 13:15:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2932 states. [2018-11-26 13:15:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 4523 transitions. [2018-11-26 13:15:29,135 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 4523 transitions. Word has length 253 [2018-11-26 13:15:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:29,136 INFO L480 AbstractCegarLoop]: Abstraction has 2932 states and 4523 transitions. [2018-11-26 13:15:29,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:15:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 4523 transitions. [2018-11-26 13:15:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-26 13:15:29,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:29,138 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 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-11-26 13:15:29,139 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:29,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash -675748449, now seen corresponding path program 1 times [2018-11-26 13:15:29,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:29,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:29,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:29,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 354 proven. 138 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-11-26 13:15:29,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-26 13:15:29,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-26 13:15:29,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:29,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:15:29,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-26 13:15:29,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-26 13:15:29,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-26 13:15:29,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:15:29,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:15:29,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:15:29,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:29,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-11-26 13:15:29,956 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,966 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,973 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:29,996 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-11-26 13:15:30,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-11-26 13:15:30,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-11-26 13:15:30,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-11-26 13:15:30,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-11-26 13:15:30,183 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,207 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,259 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-11-26 13:15:30,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:15:30,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:15:30,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:15:30,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:15:30,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:15:30,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:15:30,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-11-26 13:15:30,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-11-26 13:15:30,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-11-26 13:15:30,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,487 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-11-26 13:15:30,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:15:30,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:15:30,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:15:30,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:15:30,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:15:30,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-11-26 13:15:30,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:15:30,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:15:30,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:15:30,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:15:30,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-11-26 13:15:30,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 122 [2018-11-26 13:15:30,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:15:30,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-11-26 13:15:30,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:30,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-11-26 13:15:30,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-11-26 13:15:30,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-11-26 13:15:30,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,874 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-11-26 13:15:30,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 122 [2018-11-26 13:15:30,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:15:30,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-11-26 13:15:30,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-11-26 13:15:30,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:15:30,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-11-26 13:15:30,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-26 13:15:30,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:30,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:30,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-11-26 13:15:30,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:31,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:31,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:15:31,003 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-11-26 13:15:31,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:31,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:31,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:31,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-11-26 13:15:31,075 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,095 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 80 [2018-11-26 13:15:31,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-11-26 13:15:31,124 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:31,139 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:31,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-11-26 13:15:31,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-26 13:15:31,153 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:31,157 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:31,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-26 13:15:31,167 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:207, output treesize:32 [2018-11-26 13:15:31,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-26 13:15:31,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-26 13:15:31,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:31,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:31,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-26 13:15:31,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:31,259 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-11-26 13:15:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 91 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-26 13:15:31,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-26 13:15:31,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-26 13:15:31,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-26 13:15:31,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-26 13:15:31,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-26 13:15:31,602 INFO L87 Difference]: Start difference. First operand 2932 states and 4523 transitions. Second operand 13 states. [2018-11-26 13:15:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:34,264 INFO L93 Difference]: Finished difference Result 6173 states and 9466 transitions. [2018-11-26 13:15:34,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-26 13:15:34,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 266 [2018-11-26 13:15:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:34,268 INFO L225 Difference]: With dead ends: 6173 [2018-11-26 13:15:34,268 INFO L226 Difference]: Without dead ends: 3268 [2018-11-26 13:15:34,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 262 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-26 13:15:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2018-11-26 13:15:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 2738. [2018-11-26 13:15:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2018-11-26 13:15:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 4195 transitions. [2018-11-26 13:15:34,574 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 4195 transitions. Word has length 266 [2018-11-26 13:15:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:34,574 INFO L480 AbstractCegarLoop]: Abstraction has 2738 states and 4195 transitions. [2018-11-26 13:15:34,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-26 13:15:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 4195 transitions. [2018-11-26 13:15:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-26 13:15:34,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:34,577 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:34,577 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:34,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1107594954, now seen corresponding path program 1 times [2018-11-26 13:15:34,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:34,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-26 13:15:34,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:34,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-26 13:15:34,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-26 13:15:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-26 13:15:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:34,727 INFO L87 Difference]: Start difference. First operand 2738 states and 4195 transitions. Second operand 5 states. [2018-11-26 13:15:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:35,698 INFO L93 Difference]: Finished difference Result 5844 states and 8922 transitions. [2018-11-26 13:15:35,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:35,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-11-26 13:15:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:35,703 INFO L225 Difference]: With dead ends: 5844 [2018-11-26 13:15:35,703 INFO L226 Difference]: Without dead ends: 3133 [2018-11-26 13:15:35,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:15:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2018-11-26 13:15:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2738. [2018-11-26 13:15:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2018-11-26 13:15:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 4179 transitions. [2018-11-26 13:15:36,007 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 4179 transitions. Word has length 284 [2018-11-26 13:15:36,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:36,008 INFO L480 AbstractCegarLoop]: Abstraction has 2738 states and 4179 transitions. [2018-11-26 13:15:36,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-26 13:15:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 4179 transitions. [2018-11-26 13:15:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-26 13:15:36,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:36,011 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:15:36,011 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:36,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:36,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1205077314, now seen corresponding path program 1 times [2018-11-26 13:15:36,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:36,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:36,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:36,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:36,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-11-26 13:15:36,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:15:36,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:15:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:15:36,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:15:36,137 INFO L87 Difference]: Start difference. First operand 2738 states and 4179 transitions. Second operand 4 states. [2018-11-26 13:15:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:36,911 INFO L93 Difference]: Finished difference Result 5546 states and 8459 transitions. [2018-11-26 13:15:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:15:36,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-11-26 13:15:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:36,914 INFO L225 Difference]: With dead ends: 5546 [2018-11-26 13:15:36,915 INFO L226 Difference]: Without dead ends: 2835 [2018-11-26 13:15:36,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:15:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2018-11-26 13:15:37,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2738. [2018-11-26 13:15:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2018-11-26 13:15:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 4171 transitions. [2018-11-26 13:15:37,261 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 4171 transitions. Word has length 285 [2018-11-26 13:15:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:37,261 INFO L480 AbstractCegarLoop]: Abstraction has 2738 states and 4171 transitions. [2018-11-26 13:15:37,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:15:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 4171 transitions. [2018-11-26 13:15:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-26 13:15:37,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:37,265 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 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-11-26 13:15:37,265 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:37,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:37,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1445744256, now seen corresponding path program 1 times [2018-11-26 13:15:37,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-26 13:15:37,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-26 13:15:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:37,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-26 13:15:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-26 13:15:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-26 13:15:37,680 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-26 13:15:37,762 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967311 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-26 13:15:37,763 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967336 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-26 13:15:37,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:15:37 BoogieIcfgContainer [2018-11-26 13:15:37,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-26 13:15:37,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-26 13:15:37,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-26 13:15:37,867 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-26 13:15:37,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:13:44" (3/4) ... [2018-11-26 13:15:37,872 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-26 13:15:37,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-26 13:15:37,873 INFO L168 Benchmark]: Toolchain (without parser) took 115243.10 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 983.1 MB. Max. memory is 11.5 GB. [2018-11-26 13:15:37,874 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:15:37,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2018-11-26 13:15:37,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:15:37,875 INFO L168 Benchmark]: Boogie Preprocessor took 95.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-26 13:15:37,875 INFO L168 Benchmark]: RCFGBuilder took 1045.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 87.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. [2018-11-26 13:15:37,876 INFO L168 Benchmark]: TraceAbstraction took 113354.86 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 992.5 MB). Free memory was 995.9 MB in the beginning and 1.1 GB in the end (delta: -76.3 MB). Peak memory consumption was 916.2 MB. Max. memory is 11.5 GB. [2018-11-26 13:15:37,876 INFO L168 Benchmark]: Witness Printer took 5.46 ms. Allocated memory is still 2.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:15:37,878 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.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1045.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.9 MB in the end (delta: 87.4 MB). Peak memory consumption was 87.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 113354.86 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 992.5 MB). Free memory was 995.9 MB in the beginning and 1.1 GB in the end (delta: -76.3 MB). Peak memory consumption was 916.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.46 ms. Allocated memory is still 2.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967311 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967336 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1735]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1434. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967352, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4294967309:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={4294967330:0}, malloc(sizeof(SSL_CTX))={4294967353:0}, malloc(sizeof(SSL_SESSION))={4294967299:0}, malloc(sizeof(struct ssl3_state_st))={4294967347:0}, s={4294967330:0}, SSLv3_server_data={4294967309:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={4294967330:0}, SSLv3_server_data={4294967309:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->info_callback={5:-4}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={5:-4}, blastFlag=1, got_new_session=0, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->hit=0, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={5:-4}, ((s->s3)->tmp.new_cipher)->algorithms=8512, (s->s3)->tmp.new_cipher={4294967330:40}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1371] s->state = 8528 [L1372] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1376] EXPR s->s3 [L1376] EXPR (s->s3)->tmp.new_cipher [L1376] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1376] l = ((s->s3)->tmp.new_cipher)->algorithms [L1377] EXPR s->options VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->options=4294967338, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1377] COND TRUE s->options & 2097152UL [L1378] EXPR s->s3 [L1378] (s->s3)->tmp.use_rsa_tmp = 1 [L1382] EXPR s->s3 [L1382] (s->s3)->tmp.use_rsa_tmp VAL [={5:-4}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1400] ret = __VERIFIER_nondet_int() [L1401] COND FALSE !(ret <= 0) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] s->state = 8544 [L1419] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1423] EXPR s->verify_mode VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->verify_mode=4294967296, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1423] COND TRUE s->verify_mode & 1 [L1424] EXPR s->session [L1424] EXPR (s->session)->peer VAL [={5:-4}, (s->session)->peer={1:4294967295}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->session={4294967299:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1424] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1434] EXPR s->s3 [L1434] EXPR (s->s3)->tmp.new_cipher [L1434] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={5:-4}, ((s->s3)->tmp.new_cipher)->algorithms=8544, (s->s3)->tmp.new_cipher={4294967330:40}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1444] EXPR s->s3 [L1444] (s->s3)->tmp.cert_request = 1 [L1445] ret = __VERIFIER_nondet_int() [L1446] COND FALSE !(ret <= 0) [L1451] s->state = 8448 [L1452] EXPR s->s3 [L1452] (s->s3)->tmp.next_state = 8576 [L1453] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND TRUE s->state == 8576 [L1492] ret = __VERIFIER_nondet_int() [L1493] COND FALSE !(ret <= 0) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1498] COND FALSE !(ret == 2) [L1501] ret = __VERIFIER_nondet_int() [L1502] COND FALSE !(ret <= 0) [L1507] s->init_num = 0 [L1508] s->state = 8592 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND TRUE s->state == 8592 [L1513] ret = __VERIFIER_nondet_int() [L1514] COND FALSE !(ret <= 0) [L1519] s->state = 8608 [L1520] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND TRUE s->state == 8608 [L1524] ret = __VERIFIER_nondet_int() [L1525] COND FALSE !(ret <= 0) [L1530] s->state = 8640 [L1531] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1223] COND TRUE s->state == 8640 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1539] COND FALSE !(blastFlag == 7) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1542] COND FALSE !(blastFlag == 10) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1735] __VERIFIER_error() VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 162 locations, 1 error locations. UNSAFE Result, 113.2s OverallTime, 140 OverallIterations, 10 TraceHistogramMax, 80.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32213 SDtfs, 15027 SDslu, 59248 SDs, 0 SdLazy, 42349 SolverSat, 3135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2153 GetRequests, 1417 SyntacticMatches, 204 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2940occurred in iteration=135, 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: 10.4s AutomataMinimizationTime, 139 MinimizatonAttempts, 27818 StatesRemovedByMinimization, 136 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 21726 NumberOfCodeBlocks, 21726 NumberOfCodeBlocksAsserted, 146 NumberOfCheckSat, 21287 ConstructedInterpolants, 37 QuantifiedInterpolants, 16436392 SizeOfPredicates, 43 NumberOfNonLiveVariables, 4802 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 144 InterpolantComputations, 135 PerfectInterpolantSequences, 28792/29805 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.23-9653033 [2018-11-26 13:15:40,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-26 13:15:40,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-26 13:15:40,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-26 13:15:40,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-26 13:15:40,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-26 13:15:40,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-26 13:15:40,542 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-26 13:15:40,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-26 13:15:40,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-26 13:15:40,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-26 13:15:40,546 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-26 13:15:40,547 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-26 13:15:40,547 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-26 13:15:40,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-26 13:15:40,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-26 13:15:40,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-26 13:15:40,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-26 13:15:40,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-26 13:15:40,556 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-26 13:15:40,557 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-26 13:15:40,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-26 13:15:40,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-26 13:15:40,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-26 13:15:40,561 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-26 13:15:40,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-26 13:15:40,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-26 13:15:40,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-26 13:15:40,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-26 13:15:40,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-26 13:15:40,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-26 13:15:40,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-26 13:15:40,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-26 13:15:40,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-26 13:15:40,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-26 13:15:40,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-26 13:15:40,568 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-26 13:15:40,583 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-26 13:15:40,583 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-26 13:15:40,584 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-26 13:15:40,584 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-26 13:15:40,585 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-26 13:15:40,585 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-26 13:15:40,585 INFO L133 SettingsManager]: * Use SBE=true [2018-11-26 13:15:40,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-26 13:15:40,586 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-26 13:15:40,586 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-26 13:15:40,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-26 13:15:40,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-26 13:15:40,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-26 13:15:40,587 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-26 13:15:40,587 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-26 13:15:40,587 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-26 13:15:40,587 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-26 13:15:40,587 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-26 13:15:40,588 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-26 13:15:40,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-26 13:15:40,588 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-26 13:15:40,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-26 13:15:40,589 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-26 13:15:40,589 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-26 13:15:40,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:15:40,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-26 13:15:40,589 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-26 13:15:40,590 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-26 13:15:40,590 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-26 13:15:40,590 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-26 13:15:40,590 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-26 13:15:40,590 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-26 13:15:40,591 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 -> 00e4f55488ef7cc05fee246c4257b6c9346382d0 [2018-11-26 13:15:40,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-26 13:15:40,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-26 13:15:40,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-26 13:15:40,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-26 13:15:40,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-26 13:15:40,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-11-26 13:15:40,720 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886779bb1/7373880c243a4af89b8611783119fe9f/FLAGea29782f0 [2018-11-26 13:15:41,201 INFO L307 CDTParser]: Found 1 translation units. [2018-11-26 13:15:41,202 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-11-26 13:15:41,221 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886779bb1/7373880c243a4af89b8611783119fe9f/FLAGea29782f0 [2018-11-26 13:15:41,682 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886779bb1/7373880c243a4af89b8611783119fe9f [2018-11-26 13:15:41,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-26 13:15:41,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-26 13:15:41,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-26 13:15:41,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-26 13:15:41,692 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-26 13:15:41,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:15:41" (1/1) ... [2018-11-26 13:15:41,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c57be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:41, skipping insertion in model container [2018-11-26 13:15:41,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:15:41" (1/1) ... [2018-11-26 13:15:41,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-26 13:15:41,769 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-26 13:15:42,184 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:15:42,272 INFO L191 MainTranslator]: Completed pre-run [2018-11-26 13:15:42,381 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-26 13:15:42,405 INFO L195 MainTranslator]: Completed translation [2018-11-26 13:15:42,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42 WrapperNode [2018-11-26 13:15:42,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-26 13:15:42,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-26 13:15:42,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-26 13:15:42,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-26 13:15:42,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-26 13:15:42,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-26 13:15:42,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-26 13:15:42,456 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-26 13:15:42,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... [2018-11-26 13:15:42,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-26 13:15:42,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-26 13:15:42,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-26 13:15:42,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-26 13:15:42,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-26 13:15:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-26 13:15:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-26 13:15:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-26 13:15:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-26 13:15:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-26 13:15:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-26 13:15:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-26 13:15:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-26 13:15:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-26 13:15:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-26 13:15:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-26 13:15:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-26 13:15:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-26 13:15:42,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-26 13:15:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-26 13:15:42,944 WARN L645 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-26 13:15:42,944 WARN L610 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-26 13:15:46,146 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-26 13:15:46,146 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-26 13:15:46,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:15:46 BoogieIcfgContainer [2018-11-26 13:15:46,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-26 13:15:46,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-26 13:15:46,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-26 13:15:46,151 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-26 13:15:46,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:15:41" (1/3) ... [2018-11-26 13:15:46,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1388d82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:15:46, skipping insertion in model container [2018-11-26 13:15:46,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:15:42" (2/3) ... [2018-11-26 13:15:46,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1388d82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:15:46, skipping insertion in model container [2018-11-26 13:15:46,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:15:46" (3/3) ... [2018-11-26 13:15:46,155 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-11-26 13:15:46,163 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-26 13:15:46,171 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-26 13:15:46,187 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-26 13:15:46,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-26 13:15:46,219 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-26 13:15:46,219 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-26 13:15:46,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-26 13:15:46,220 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-26 13:15:46,220 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-26 13:15:46,220 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-26 13:15:46,220 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-26 13:15:46,220 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-26 13:15:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-11-26 13:15:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-26 13:15:46,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:46,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:15:46,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:46,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1596262401, now seen corresponding path program 1 times [2018-11-26 13:15:46,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:15:46,269 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-11-26 13:15:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:46,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:15:46,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:15:46,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:15:46,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:46,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:15:46,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:46,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:15:46,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:15:46,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:46,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:15:46,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:46,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:46,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:15:46,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:15:46,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:15:46,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:15:46,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:46,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:15:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:15:46,893 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:15:46,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:46,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:15:46,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:15:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:15:46,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:15:46,925 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 6 states. [2018-11-26 13:15:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:15:57,578 INFO L93 Difference]: Finished difference Result 415 states and 702 transitions. [2018-11-26 13:15:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:15:57,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-11-26 13:15:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:15:57,599 INFO L225 Difference]: With dead ends: 415 [2018-11-26 13:15:57,599 INFO L226 Difference]: Without dead ends: 243 [2018-11-26 13:15:57,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:15:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-26 13:15:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 175. [2018-11-26 13:15:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-26 13:15:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 278 transitions. [2018-11-26 13:15:57,656 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 278 transitions. Word has length 49 [2018-11-26 13:15:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:15:57,657 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 278 transitions. [2018-11-26 13:15:57,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:15:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 278 transitions. [2018-11-26 13:15:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-26 13:15:57,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:15:57,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:15:57,661 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:15:57,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:15:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash 288531025, now seen corresponding path program 1 times [2018-11-26 13:15:57,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:15:57,662 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-11-26 13:15:57,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:15:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:15:57,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:15:57,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:15:57,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:15:57,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:57,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:15:57,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:57,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:15:57,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:57,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:57,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:57,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:15:58,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:58,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:15:58,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:58,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:15:58,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:15:58,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:15:58,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:15:58,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:15:58,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:15:58,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:15:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:15:58,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:15:58,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:15:58,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:15:58,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:15:58,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:15:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:15:58,127 INFO L87 Difference]: Start difference. First operand 175 states and 278 transitions. Second operand 6 states. [2018-11-26 13:16:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:16:06,007 INFO L93 Difference]: Finished difference Result 365 states and 563 transitions. [2018-11-26 13:16:06,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:16:06,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-26 13:16:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:16:06,012 INFO L225 Difference]: With dead ends: 365 [2018-11-26 13:16:06,012 INFO L226 Difference]: Without dead ends: 235 [2018-11-26 13:16:06,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:16:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-26 13:16:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 176. [2018-11-26 13:16:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-26 13:16:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 279 transitions. [2018-11-26 13:16:06,029 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 279 transitions. Word has length 50 [2018-11-26 13:16:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:16:06,030 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 279 transitions. [2018-11-26 13:16:06,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:16:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 279 transitions. [2018-11-26 13:16:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-26 13:16:06,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:16:06,032 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:16:06,033 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:16:06,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:16:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1059853705, now seen corresponding path program 1 times [2018-11-26 13:16:06,034 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:16:06,034 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-11-26 13:16:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:16:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:16:06,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:16:06,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:16:06,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:16:06,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:06,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:16:06,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:06,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:16:06,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:16:06,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:06,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:16:06,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:06,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:06,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:16:06,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:16:06,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:16:06,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:16:06,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:06,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:16:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:16:06,623 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:16:06,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:16:06,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:16:06,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:16:06,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:16:06,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:16:06,627 INFO L87 Difference]: Start difference. First operand 176 states and 279 transitions. Second operand 6 states. [2018-11-26 13:16:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:16:14,918 INFO L93 Difference]: Finished difference Result 365 states and 562 transitions. [2018-11-26 13:16:14,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:16:14,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-26 13:16:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:16:14,921 INFO L225 Difference]: With dead ends: 365 [2018-11-26 13:16:14,921 INFO L226 Difference]: Without dead ends: 235 [2018-11-26 13:16:14,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:16:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-26 13:16:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 176. [2018-11-26 13:16:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-26 13:16:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 278 transitions. [2018-11-26 13:16:14,936 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 278 transitions. Word has length 62 [2018-11-26 13:16:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:16:14,936 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 278 transitions. [2018-11-26 13:16:14,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:16:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 278 transitions. [2018-11-26 13:16:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-26 13:16:14,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:16:14,938 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:16:14,939 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:16:14,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:16:14,939 INFO L82 PathProgramCache]: Analyzing trace with hash 337135581, now seen corresponding path program 1 times [2018-11-26 13:16:14,939 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:16:14,940 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-11-26 13:16:14,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:16:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:16:15,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:16:15,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2018-11-26 13:16:15,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 73 [2018-11-26 13:16:15,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:16:15,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:16:15,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:15,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-11-26 13:16:15,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:15,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 24 [2018-11-26 13:16:15,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:16:15,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:16:15,294 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,299 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,313 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2018-11-26 13:16:15,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:16:15,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:16:15,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:15,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:16:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:16:15,355 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:16:15,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:16:15,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:16:15,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:16:15,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:16:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:16:15,359 INFO L87 Difference]: Start difference. First operand 176 states and 278 transitions. Second operand 4 states. [2018-11-26 13:16:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:16:22,546 INFO L93 Difference]: Finished difference Result 413 states and 647 transitions. [2018-11-26 13:16:22,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:16:22,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-26 13:16:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:16:22,551 INFO L225 Difference]: With dead ends: 413 [2018-11-26 13:16:22,552 INFO L226 Difference]: Without dead ends: 283 [2018-11-26 13:16:22,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:16:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-26 13:16:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 215. [2018-11-26 13:16:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-26 13:16:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 350 transitions. [2018-11-26 13:16:22,569 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 350 transitions. Word has length 63 [2018-11-26 13:16:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:16:22,570 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 350 transitions. [2018-11-26 13:16:22,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:16:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 350 transitions. [2018-11-26 13:16:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-26 13:16:22,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:16:22,572 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:16:22,573 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:16:22,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:16:22,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1452142420, now seen corresponding path program 1 times [2018-11-26 13:16:22,574 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:16:22,574 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-11-26 13:16:22,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:16:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:16:22,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:16:22,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:16:22,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:16:22,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:22,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:16:23,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:23,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:16:23,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:16:23,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:23,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:16:23,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:23,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:23,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:16:23,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:16:23,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:16:23,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:16:23,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:23,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:16:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:16:23,155 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:16:23,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:16:23,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:16:23,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:16:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:16:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:16:23,159 INFO L87 Difference]: Start difference. First operand 215 states and 350 transitions. Second operand 6 states. [2018-11-26 13:16:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:16:29,951 INFO L93 Difference]: Finished difference Result 441 states and 703 transitions. [2018-11-26 13:16:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:16:29,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-26 13:16:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:16:29,957 INFO L225 Difference]: With dead ends: 441 [2018-11-26 13:16:29,957 INFO L226 Difference]: Without dead ends: 272 [2018-11-26 13:16:29,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:16:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-26 13:16:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2018-11-26 13:16:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-26 13:16:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 349 transitions. [2018-11-26 13:16:29,972 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 349 transitions. Word has length 63 [2018-11-26 13:16:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:16:29,972 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 349 transitions. [2018-11-26 13:16:29,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:16:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 349 transitions. [2018-11-26 13:16:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-26 13:16:29,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:16:29,973 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:16:29,974 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:16:29,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:16:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1519702421, now seen corresponding path program 1 times [2018-11-26 13:16:29,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:16:29,975 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-11-26 13:16:30,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:16:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:16:30,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:16:30,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:16:30,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:16:30,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:30,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:30,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:30,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:16:30,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:16:30,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:16:30,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:30,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:30,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:30,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:16:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:16:30,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:16:30,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:16:30,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:16:30,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:16:30,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:16:30,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:16:30,247 INFO L87 Difference]: Start difference. First operand 215 states and 349 transitions. Second operand 4 states. [2018-11-26 13:16:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:16:37,475 INFO L93 Difference]: Finished difference Result 492 states and 791 transitions. [2018-11-26 13:16:37,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:16:37,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-26 13:16:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:16:37,482 INFO L225 Difference]: With dead ends: 492 [2018-11-26 13:16:37,482 INFO L226 Difference]: Without dead ends: 323 [2018-11-26 13:16:37,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:16:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-26 13:16:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 216. [2018-11-26 13:16:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-26 13:16:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 350 transitions. [2018-11-26 13:16:37,497 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 350 transitions. Word has length 63 [2018-11-26 13:16:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:16:37,497 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 350 transitions. [2018-11-26 13:16:37,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:16:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 350 transitions. [2018-11-26 13:16:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-26 13:16:37,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:16:37,498 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:16:37,499 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:16:37,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:16:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1612792454, now seen corresponding path program 1 times [2018-11-26 13:16:37,500 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:16:37,500 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-11-26 13:16:37,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:16:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:16:37,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:16:37,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:16:37,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:16:37,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:37,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:16:38,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:38,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:16:38,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:16:38,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:38,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:16:38,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:38,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:38,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:16:38,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:16:38,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:16:38,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:16:38,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:38,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:16:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:16:38,116 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:16:38,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:16:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:16:38,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:16:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:16:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:16:38,121 INFO L87 Difference]: Start difference. First operand 216 states and 350 transitions. Second operand 6 states. [2018-11-26 13:16:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:16:44,584 INFO L93 Difference]: Finished difference Result 443 states and 704 transitions. [2018-11-26 13:16:44,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:16:44,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-26 13:16:44,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:16:44,588 INFO L225 Difference]: With dead ends: 443 [2018-11-26 13:16:44,588 INFO L226 Difference]: Without dead ends: 273 [2018-11-26 13:16:44,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:16:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-26 13:16:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 216. [2018-11-26 13:16:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-26 13:16:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 349 transitions. [2018-11-26 13:16:44,602 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 349 transitions. Word has length 64 [2018-11-26 13:16:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:16:44,602 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 349 transitions. [2018-11-26 13:16:44,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:16:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 349 transitions. [2018-11-26 13:16:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-26 13:16:44,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:16:44,603 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:16:44,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:16:44,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:16:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2084828355, now seen corresponding path program 1 times [2018-11-26 13:16:44,604 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:16:44,604 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-11-26 13:16:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:16:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:16:44,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:16:44,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:16:44,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:16:44,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:44,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:44,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:44,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:16:44,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:16:44,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:16:44,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:44,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:44,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:44,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:16:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:16:44,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:16:44,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:16:44,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:16:44,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:16:44,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:16:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:16:44,886 INFO L87 Difference]: Start difference. First operand 216 states and 349 transitions. Second operand 4 states. [2018-11-26 13:16:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:16:54,821 INFO L93 Difference]: Finished difference Result 485 states and 779 transitions. [2018-11-26 13:16:54,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:16:54,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-26 13:16:54,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:16:54,826 INFO L225 Difference]: With dead ends: 485 [2018-11-26 13:16:54,826 INFO L226 Difference]: Without dead ends: 315 [2018-11-26 13:16:54,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:16:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-26 13:16:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 233. [2018-11-26 13:16:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-26 13:16:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 378 transitions. [2018-11-26 13:16:54,839 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 378 transitions. Word has length 64 [2018-11-26 13:16:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:16:54,839 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 378 transitions. [2018-11-26 13:16:54,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:16:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 378 transitions. [2018-11-26 13:16:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-26 13:16:54,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:16:54,840 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, 1, 1, 1, 1, 1, 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-11-26 13:16:54,840 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:16:54,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:16:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1046639462, now seen corresponding path program 1 times [2018-11-26 13:16:54,841 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:16:54,841 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-11-26 13:16:54,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:16:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:16:55,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:16:55,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:16:55,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:16:55,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:55,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:16:55,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:55,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:16:55,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:16:55,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:55,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:16:55,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:55,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:16:55,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:16:55,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:16:55,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:16:55,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:16:55,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:16:55,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:16:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:16:55,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:16:55,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:16:55,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:16:55,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:16:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:16:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:16:55,583 INFO L87 Difference]: Start difference. First operand 233 states and 378 transitions. Second operand 6 states. [2018-11-26 13:17:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:17:01,569 INFO L93 Difference]: Finished difference Result 522 states and 848 transitions. [2018-11-26 13:17:01,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:17:01,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-26 13:17:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:17:01,573 INFO L225 Difference]: With dead ends: 522 [2018-11-26 13:17:01,573 INFO L226 Difference]: Without dead ends: 312 [2018-11-26 13:17:01,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:17:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-26 13:17:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 233. [2018-11-26 13:17:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-26 13:17:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 377 transitions. [2018-11-26 13:17:01,591 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 377 transitions. Word has length 64 [2018-11-26 13:17:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:17:01,591 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 377 transitions. [2018-11-26 13:17:01,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:17:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 377 transitions. [2018-11-26 13:17:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-26 13:17:01,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:17:01,592 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:17:01,592 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:17:01,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:17:01,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1744402129, now seen corresponding path program 1 times [2018-11-26 13:17:01,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:17:01,593 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-11-26 13:17:01,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:17:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:17:01,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:17:01,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:17:01,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:17:01,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:01,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:17:02,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:02,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:17:02,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:17:02,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:02,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:17:02,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:02,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:02,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:17:02,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:17:02,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:17:02,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:17:02,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:02,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:17:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:17:02,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:17:02,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:17:02,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:17:02,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:17:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:17:02,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:17:02,135 INFO L87 Difference]: Start difference. First operand 233 states and 377 transitions. Second operand 6 states. [2018-11-26 13:17:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:17:08,305 INFO L93 Difference]: Finished difference Result 522 states and 847 transitions. [2018-11-26 13:17:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:17:08,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-26 13:17:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:17:08,310 INFO L225 Difference]: With dead ends: 522 [2018-11-26 13:17:08,310 INFO L226 Difference]: Without dead ends: 312 [2018-11-26 13:17:08,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:17:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-26 13:17:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 233. [2018-11-26 13:17:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-26 13:17:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 376 transitions. [2018-11-26 13:17:08,325 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 376 transitions. Word has length 65 [2018-11-26 13:17:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:17:08,325 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 376 transitions. [2018-11-26 13:17:08,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:17:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 376 transitions. [2018-11-26 13:17:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-26 13:17:08,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:17:08,326 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:17:08,326 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:17:08,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:17:08,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1864174496, now seen corresponding path program 1 times [2018-11-26 13:17:08,327 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:17:08,327 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-11-26 13:17:08,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:17:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:17:08,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:17:08,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:17:08,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:17:08,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:08,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:08,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:17:08,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:08,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:08,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:08,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:08,713 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:17:08,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:17:08,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:08,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:17:08,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:08,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:08,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:08,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:17:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:17:08,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:17:08,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:17:08,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:17:08,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:17:08,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:17:08,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:17:08,785 INFO L87 Difference]: Start difference. First operand 233 states and 376 transitions. Second operand 7 states. [2018-11-26 13:17:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:17:25,725 INFO L93 Difference]: Finished difference Result 550 states and 891 transitions. [2018-11-26 13:17:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:17:25,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-11-26 13:17:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:17:25,728 INFO L225 Difference]: With dead ends: 550 [2018-11-26 13:17:25,728 INFO L226 Difference]: Without dead ends: 340 [2018-11-26 13:17:25,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:17:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-26 13:17:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 233. [2018-11-26 13:17:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-26 13:17:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 376 transitions. [2018-11-26 13:17:25,748 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 376 transitions. Word has length 66 [2018-11-26 13:17:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:17:25,748 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 376 transitions. [2018-11-26 13:17:25,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:17:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 376 transitions. [2018-11-26 13:17:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-26 13:17:25,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:17:25,749 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:17:25,750 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:17:25,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:17:25,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2082272577, now seen corresponding path program 1 times [2018-11-26 13:17:25,750 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:17:25,750 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-11-26 13:17:25,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:17:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:17:26,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:17:26,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:17:26,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:17:26,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:26,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:17:26,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:26,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:17:26,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:17:26,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:26,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:17:26,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:26,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:26,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:17:26,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:17:26,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:17:26,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:17:26,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:26,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:17:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:17:26,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:17:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:17:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:17:26,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:17:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:17:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:17:26,289 INFO L87 Difference]: Start difference. First operand 233 states and 376 transitions. Second operand 6 states. [2018-11-26 13:17:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:17:32,449 INFO L93 Difference]: Finished difference Result 522 states and 846 transitions. [2018-11-26 13:17:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:17:32,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-26 13:17:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:17:32,452 INFO L225 Difference]: With dead ends: 522 [2018-11-26 13:17:32,452 INFO L226 Difference]: Without dead ends: 312 [2018-11-26 13:17:32,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:17:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-26 13:17:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 233. [2018-11-26 13:17:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-26 13:17:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 375 transitions. [2018-11-26 13:17:32,466 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 375 transitions. Word has length 66 [2018-11-26 13:17:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:17:32,466 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 375 transitions. [2018-11-26 13:17:32,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:17:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 375 transitions. [2018-11-26 13:17:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-26 13:17:32,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:17:32,467 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:17:32,468 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:17:32,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:17:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash 224292396, now seen corresponding path program 1 times [2018-11-26 13:17:32,468 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:17:32,468 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-11-26 13:17:32,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:17:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:17:32,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:17:32,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:17:32,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:17:32,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:32,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:17:32,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:32,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:17:32,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,903 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:17:32,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:32,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:17:32,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:32,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:32,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:17:32,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:17:32,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:17:32,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:17:32,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:32,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:17:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:17:33,008 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:17:33,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:17:33,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:17:33,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:17:33,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:17:33,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:17:33,011 INFO L87 Difference]: Start difference. First operand 233 states and 375 transitions. Second operand 6 states. [2018-11-26 13:17:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:17:38,465 INFO L93 Difference]: Finished difference Result 512 states and 832 transitions. [2018-11-26 13:17:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:17:38,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-26 13:17:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:17:38,469 INFO L225 Difference]: With dead ends: 512 [2018-11-26 13:17:38,470 INFO L226 Difference]: Without dead ends: 302 [2018-11-26 13:17:38,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:17:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-11-26 13:17:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 233. [2018-11-26 13:17:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-26 13:17:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 374 transitions. [2018-11-26 13:17:38,491 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 374 transitions. Word has length 67 [2018-11-26 13:17:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:17:38,491 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 374 transitions. [2018-11-26 13:17:38,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:17:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 374 transitions. [2018-11-26 13:17:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-26 13:17:38,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:17:38,493 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:17:38,493 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:17:38,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:17:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 3871378, now seen corresponding path program 1 times [2018-11-26 13:17:38,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:17:38,494 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-11-26 13:17:38,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:17:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:17:38,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:17:38,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:17:38,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:17:38,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:38,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:38,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:17:38,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:38,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:38,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:38,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:38,915 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:17:38,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:17:38,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:38,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:17:38,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:38,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:38,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:38,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:17:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:17:38,966 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:17:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:17:38,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:17:38,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:17:38,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:17:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:17:38,972 INFO L87 Difference]: Start difference. First operand 233 states and 374 transitions. Second operand 7 states. [2018-11-26 13:17:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:17:57,552 INFO L93 Difference]: Finished difference Result 542 states and 877 transitions. [2018-11-26 13:17:57,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:17:57,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-11-26 13:17:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:17:57,555 INFO L225 Difference]: With dead ends: 542 [2018-11-26 13:17:57,555 INFO L226 Difference]: Without dead ends: 332 [2018-11-26 13:17:57,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:17:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-26 13:17:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 233. [2018-11-26 13:17:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-26 13:17:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 374 transitions. [2018-11-26 13:17:57,572 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 374 transitions. Word has length 67 [2018-11-26 13:17:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:17:57,573 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 374 transitions. [2018-11-26 13:17:57,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:17:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 374 transitions. [2018-11-26 13:17:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-26 13:17:57,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:17:57,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:17:57,574 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:17:57,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:17:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2045716476, now seen corresponding path program 1 times [2018-11-26 13:17:57,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:17:57,575 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-11-26 13:17:57,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:17:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:17:57,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:17:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:17:57,681 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:17:57,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:17:57,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:17:57,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:17:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:17:57,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:17:57,684 INFO L87 Difference]: Start difference. First operand 233 states and 374 transitions. Second operand 3 states. [2018-11-26 13:17:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:17:57,782 INFO L93 Difference]: Finished difference Result 648 states and 1064 transitions. [2018-11-26 13:17:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:17:57,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-26 13:17:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:17:57,785 INFO L225 Difference]: With dead ends: 648 [2018-11-26 13:17:57,785 INFO L226 Difference]: Without dead ends: 438 [2018-11-26 13:17:57,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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-11-26 13:17:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-11-26 13:17:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2018-11-26 13:17:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-26 13:17:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 702 transitions. [2018-11-26 13:17:57,840 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 702 transitions. Word has length 71 [2018-11-26 13:17:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:17:57,840 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 702 transitions. [2018-11-26 13:17:57,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:17:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 702 transitions. [2018-11-26 13:17:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-26 13:17:57,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:17:57,842 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:17:57,842 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:17:57,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:17:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1351857542, now seen corresponding path program 1 times [2018-11-26 13:17:57,843 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:17:57,843 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-11-26 13:17:57,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:17:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:17:58,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:17:58,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:17:58,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:17:58,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:58,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:17:58,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:58,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:17:58,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:17:58,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:58,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:17:58,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:58,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:17:58,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:17:58,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:17:58,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:17:58,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:17:58,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:17:58,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:17:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:17:58,329 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:17:58,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:17:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:17:58,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:17:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:17:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:17:58,333 INFO L87 Difference]: Start difference. First operand 436 states and 702 transitions. Second operand 6 states. [2018-11-26 13:18:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:03,076 INFO L93 Difference]: Finished difference Result 918 states and 1481 transitions. [2018-11-26 13:18:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:18:03,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-26 13:18:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:03,079 INFO L225 Difference]: With dead ends: 918 [2018-11-26 13:18:03,079 INFO L226 Difference]: Without dead ends: 505 [2018-11-26 13:18:03,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:18:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-26 13:18:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 441. [2018-11-26 13:18:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-11-26 13:18:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 711 transitions. [2018-11-26 13:18:03,119 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 711 transitions. Word has length 71 [2018-11-26 13:18:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:03,119 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 711 transitions. [2018-11-26 13:18:03,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:18:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 711 transitions. [2018-11-26 13:18:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-26 13:18:03,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:03,121 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:18:03,121 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:03,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash 579748760, now seen corresponding path program 1 times [2018-11-26 13:18:03,121 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:03,122 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:03,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:03,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:18:03,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:18:03,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:03,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:18:03,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:03,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:18:03,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:18:03,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:03,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:18:03,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:03,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:03,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:18:03,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:18:03,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:18:03,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:18:03,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:03,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:18:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:03,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:03,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:03,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:18:03,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:18:03,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:18:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:18:03,651 INFO L87 Difference]: Start difference. First operand 441 states and 711 transitions. Second operand 6 states. [2018-11-26 13:18:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:09,925 INFO L93 Difference]: Finished difference Result 918 states and 1480 transitions. [2018-11-26 13:18:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:18:09,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-11-26 13:18:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:09,930 INFO L225 Difference]: With dead ends: 918 [2018-11-26 13:18:09,930 INFO L226 Difference]: Without dead ends: 505 [2018-11-26 13:18:09,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:18:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-11-26 13:18:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 443. [2018-11-26 13:18:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-26 13:18:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 714 transitions. [2018-11-26 13:18:09,959 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 714 transitions. Word has length 71 [2018-11-26 13:18:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:09,959 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 714 transitions. [2018-11-26 13:18:09,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:18:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 714 transitions. [2018-11-26 13:18:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-26 13:18:09,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:09,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:18:09,961 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:09,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1270584837, now seen corresponding path program 1 times [2018-11-26 13:18:09,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:10,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:10,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:18:10,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:18:10,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:10,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:18:10,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:10,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:18:10,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:18:10,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:10,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:18:10,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:10,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:10,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:18:10,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:18:10,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:18:10,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:18:10,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:10,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:18:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:10,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:10,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:10,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:18:10,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:18:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:18:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:18:10,469 INFO L87 Difference]: Start difference. First operand 443 states and 714 transitions. Second operand 6 states. [2018-11-26 13:18:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:16,089 INFO L93 Difference]: Finished difference Result 914 states and 1474 transitions. [2018-11-26 13:18:16,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:18:16,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-26 13:18:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:16,095 INFO L225 Difference]: With dead ends: 914 [2018-11-26 13:18:16,095 INFO L226 Difference]: Without dead ends: 501 [2018-11-26 13:18:16,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:18:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-11-26 13:18:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 443. [2018-11-26 13:18:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-26 13:18:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 713 transitions. [2018-11-26 13:18:16,140 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 713 transitions. Word has length 72 [2018-11-26 13:18:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:16,140 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 713 transitions. [2018-11-26 13:18:16,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:18:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 713 transitions. [2018-11-26 13:18:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-26 13:18:16,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:16,142 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:18:16,142 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:16,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash -819711827, now seen corresponding path program 1 times [2018-11-26 13:18:16,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:16,143 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:16,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:16,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:16,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:18:16,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:18:16,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:16,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:18:16,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:16,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:18:16,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:18:16,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:16,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:18:16,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:16,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:16,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:18:16,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:18:16,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:18:16,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:18:16,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:16,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:18:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:16,696 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:16,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:16,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:18:16,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:18:16,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:18:16,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:18:16,699 INFO L87 Difference]: Start difference. First operand 443 states and 713 transitions. Second operand 6 states. [2018-11-26 13:18:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:24,736 INFO L93 Difference]: Finished difference Result 910 states and 1468 transitions. [2018-11-26 13:18:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:18:24,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-26 13:18:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:24,740 INFO L225 Difference]: With dead ends: 910 [2018-11-26 13:18:24,740 INFO L226 Difference]: Without dead ends: 497 [2018-11-26 13:18:24,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:18:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-11-26 13:18:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 444. [2018-11-26 13:18:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-26 13:18:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 714 transitions. [2018-11-26 13:18:24,778 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 714 transitions. Word has length 72 [2018-11-26 13:18:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:24,779 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 714 transitions. [2018-11-26 13:18:24,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:18:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 714 transitions. [2018-11-26 13:18:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-26 13:18:24,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:24,780 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:18:24,780 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:24,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1058033556, now seen corresponding path program 1 times [2018-11-26 13:18:24,781 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:24,781 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:24,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:24,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:24,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-11-26 13:18:24,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2018-11-26 13:18:24,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:25,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:25,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-11-26 13:18:25,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-26 13:18:25,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:25,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-11-26 13:18:25,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-26 13:18:25,121 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:25,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:27,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2018-11-26 13:18:27,974 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-26 13:18:28,021 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:18:28,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:18:28,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-26 13:18:28,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-26 13:18:28,099 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:28,108 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:28,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-26 13:18:28,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-26 13:18:28,116 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:28,128 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:28,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-26 13:18:28,153 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:69, output treesize:29 [2018-11-26 13:18:28,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:18:28,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:18:28,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:28,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:28,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:28,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:18:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:28,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:28,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:28,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:18:28,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:18:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:18:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:18:28,208 INFO L87 Difference]: Start difference. First operand 444 states and 714 transitions. Second operand 4 states. [2018-11-26 13:18:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:33,129 INFO L93 Difference]: Finished difference Result 867 states and 1386 transitions. [2018-11-26 13:18:33,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:18:33,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-26 13:18:33,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:33,133 INFO L225 Difference]: With dead ends: 867 [2018-11-26 13:18:33,133 INFO L226 Difference]: Without dead ends: 653 [2018-11-26 13:18:33,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:18:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-26 13:18:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 444. [2018-11-26 13:18:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-26 13:18:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 714 transitions. [2018-11-26 13:18:33,177 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 714 transitions. Word has length 74 [2018-11-26 13:18:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:33,178 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 714 transitions. [2018-11-26 13:18:33,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:18:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 714 transitions. [2018-11-26 13:18:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-26 13:18:33,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:33,180 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:18:33,180 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:33,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:33,180 INFO L82 PathProgramCache]: Analyzing trace with hash -390265018, now seen corresponding path program 1 times [2018-11-26 13:18:33,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:33,181 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:33,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:33,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 36 [2018-11-26 13:18:33,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-26 13:18:33,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 59 [2018-11-26 13:18:33,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-26 13:18:33,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:33,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2018-11-26 13:18:33,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-26 13:18:33,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:18:33,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:18:33,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-26 13:18:33,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-26 13:18:33,808 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,819 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-26 13:18:33,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:18:33,828 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:33,844 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:33,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-26 13:18:33,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-26 13:18:33,883 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,887 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-26 13:18:33,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-26 13:18:33,896 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:33,909 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:18:33,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,920 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:69, output treesize:9 [2018-11-26 13:18:33,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:18:33,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:18:33,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:33,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:18:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:33,953 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:33,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:33,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:18:33,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:18:33,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:18:33,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:18:33,957 INFO L87 Difference]: Start difference. First operand 444 states and 714 transitions. Second operand 4 states. [2018-11-26 13:18:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:38,526 INFO L93 Difference]: Finished difference Result 855 states and 1369 transitions. [2018-11-26 13:18:38,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:18:38,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-11-26 13:18:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:38,531 INFO L225 Difference]: With dead ends: 855 [2018-11-26 13:18:38,531 INFO L226 Difference]: Without dead ends: 641 [2018-11-26 13:18:38,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:18:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-11-26 13:18:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 444. [2018-11-26 13:18:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-26 13:18:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 714 transitions. [2018-11-26 13:18:38,559 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 714 transitions. Word has length 75 [2018-11-26 13:18:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:38,560 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 714 transitions. [2018-11-26 13:18:38,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:18:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 714 transitions. [2018-11-26 13:18:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-26 13:18:38,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:38,561 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:18:38,561 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:38,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1201896565, now seen corresponding path program 1 times [2018-11-26 13:18:38,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:38,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:38,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:38,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:38,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:18:38,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:18:38,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:38,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:38,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:38,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:18:38,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:18:38,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:18:38,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:38,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:38,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:38,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:18:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:38,826 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:38,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:38,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:18:38,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:18:38,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:18:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:18:38,830 INFO L87 Difference]: Start difference. First operand 444 states and 714 transitions. Second operand 4 states. [2018-11-26 13:18:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:43,225 INFO L93 Difference]: Finished difference Result 1054 states and 1691 transitions. [2018-11-26 13:18:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:18:43,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-11-26 13:18:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:43,230 INFO L225 Difference]: With dead ends: 1054 [2018-11-26 13:18:43,230 INFO L226 Difference]: Without dead ends: 641 [2018-11-26 13:18:43,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:18:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-11-26 13:18:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 476. [2018-11-26 13:18:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-11-26 13:18:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 766 transitions. [2018-11-26 13:18:43,269 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 766 transitions. Word has length 76 [2018-11-26 13:18:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:43,270 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 766 transitions. [2018-11-26 13:18:43,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:18:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 766 transitions. [2018-11-26 13:18:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-26 13:18:43,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:43,271 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:18:43,272 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:43,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash -844005498, now seen corresponding path program 1 times [2018-11-26 13:18:43,273 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:43,273 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:43,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:43,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:43,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:18:43,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:18:43,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:43,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:18:43,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:43,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:18:43,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:18:43,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:43,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:18:43,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:43,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:43,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:18:43,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:18:43,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:18:43,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:18:43,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:43,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:18:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:43,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:43,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:43,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:18:43,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:18:43,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:18:43,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:18:43,874 INFO L87 Difference]: Start difference. First operand 476 states and 766 transitions. Second operand 6 states. [2018-11-26 13:18:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:48,402 INFO L93 Difference]: Finished difference Result 974 states and 1571 transitions. [2018-11-26 13:18:48,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:18:48,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-11-26 13:18:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:48,407 INFO L225 Difference]: With dead ends: 974 [2018-11-26 13:18:48,407 INFO L226 Difference]: Without dead ends: 529 [2018-11-26 13:18:48,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:18:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-26 13:18:48,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 481. [2018-11-26 13:18:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-11-26 13:18:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 775 transitions. [2018-11-26 13:18:48,441 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 775 transitions. Word has length 76 [2018-11-26 13:18:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:48,441 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 775 transitions. [2018-11-26 13:18:48,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:18:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 775 transitions. [2018-11-26 13:18:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-26 13:18:48,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:48,443 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:18:48,443 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:48,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1560503784, now seen corresponding path program 1 times [2018-11-26 13:18:48,444 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:48,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:48,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:48,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:18:48,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:18:48,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:48,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:48,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:48,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:18:48,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:18:48,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:18:48,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:48,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:48,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:48,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:18:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:48,700 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:48,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:18:48,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:18:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:18:48,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:18:48,705 INFO L87 Difference]: Start difference. First operand 481 states and 775 transitions. Second operand 4 states. [2018-11-26 13:18:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:53,853 INFO L93 Difference]: Finished difference Result 1087 states and 1746 transitions. [2018-11-26 13:18:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:18:53,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-11-26 13:18:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:53,860 INFO L225 Difference]: With dead ends: 1087 [2018-11-26 13:18:53,860 INFO L226 Difference]: Without dead ends: 642 [2018-11-26 13:18:53,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:18:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-26 13:18:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 483. [2018-11-26 13:18:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-26 13:18:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 777 transitions. [2018-11-26 13:18:53,898 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 777 transitions. Word has length 77 [2018-11-26 13:18:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:53,898 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 777 transitions. [2018-11-26 13:18:53,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:18:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 777 transitions. [2018-11-26 13:18:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-26 13:18:53,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:53,900 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:18:53,900 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:53,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash 220165677, now seen corresponding path program 1 times [2018-11-26 13:18:53,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:53,901 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:53,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:54,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:54,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:18:54,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:18:54,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:54,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:18:54,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:54,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:18:54,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:18:54,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:54,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:18:54,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:54,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:54,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:18:54,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:18:54,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:18:54,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:18:54,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:54,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:18:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:18:54,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:18:54,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:18:54,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:18:54,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:18:54,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:18:54,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:18:54,478 INFO L87 Difference]: Start difference. First operand 483 states and 777 transitions. Second operand 6 states. [2018-11-26 13:18:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:18:59,412 INFO L93 Difference]: Finished difference Result 978 states and 1574 transitions. [2018-11-26 13:18:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:18:59,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-26 13:18:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:18:59,417 INFO L225 Difference]: With dead ends: 978 [2018-11-26 13:18:59,418 INFO L226 Difference]: Without dead ends: 531 [2018-11-26 13:18:59,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:18:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-11-26 13:18:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 483. [2018-11-26 13:18:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-26 13:18:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 776 transitions. [2018-11-26 13:18:59,448 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 776 transitions. Word has length 77 [2018-11-26 13:18:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:18:59,449 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 776 transitions. [2018-11-26 13:18:59,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:18:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 776 transitions. [2018-11-26 13:18:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-26 13:18:59,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:18:59,450 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:18:59,450 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:18:59,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:18:59,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1537668687, now seen corresponding path program 1 times [2018-11-26 13:18:59,451 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:18:59,451 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:18:59,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:18:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:18:59,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:18:59,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:18:59,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:18:59,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:59,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:18:59,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:59,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:18:59,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:18:59,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:59,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:18:59,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:59,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:18:59,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:18:59,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:18:59,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:18:59,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:18:59,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:18:59,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:19:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:00,005 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:00,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:00,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:19:00,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:19:00,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:19:00,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:19:00,011 INFO L87 Difference]: Start difference. First operand 483 states and 776 transitions. Second operand 6 states. [2018-11-26 13:19:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:03,454 INFO L93 Difference]: Finished difference Result 976 states and 1571 transitions. [2018-11-26 13:19:03,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:19:03,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-26 13:19:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:03,459 INFO L225 Difference]: With dead ends: 976 [2018-11-26 13:19:03,459 INFO L226 Difference]: Without dead ends: 529 [2018-11-26 13:19:03,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:19:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-26 13:19:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 484. [2018-11-26 13:19:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-26 13:19:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 777 transitions. [2018-11-26 13:19:03,503 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 777 transitions. Word has length 77 [2018-11-26 13:19:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:03,504 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 777 transitions. [2018-11-26 13:19:03,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:19:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 777 transitions. [2018-11-26 13:19:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-26 13:19:03,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:03,505 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-26 13:19:03,505 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:03,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash 677027442, now seen corresponding path program 1 times [2018-11-26 13:19:03,506 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:03,506 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:03,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:03,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:03,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:19:03,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:19:03,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:03,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:03,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:03,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:19:03,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:19:03,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:19:03,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:03,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:03,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:03,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:19:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:03,783 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:03,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:03,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:19:03,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:19:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:19:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:19:03,786 INFO L87 Difference]: Start difference. First operand 484 states and 777 transitions. Second operand 4 states. [2018-11-26 13:19:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:08,485 INFO L93 Difference]: Finished difference Result 1090 states and 1746 transitions. [2018-11-26 13:19:08,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:19:08,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-26 13:19:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:08,491 INFO L225 Difference]: With dead ends: 1090 [2018-11-26 13:19:08,491 INFO L226 Difference]: Without dead ends: 643 [2018-11-26 13:19:08,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:19:08,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-26 13:19:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 484. [2018-11-26 13:19:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-26 13:19:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 775 transitions. [2018-11-26 13:19:08,526 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 775 transitions. Word has length 78 [2018-11-26 13:19:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:08,526 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 775 transitions. [2018-11-26 13:19:08,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:19:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 775 transitions. [2018-11-26 13:19:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-26 13:19:08,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:08,528 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-26 13:19:08,528 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:08,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:08,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1982404474, now seen corresponding path program 1 times [2018-11-26 13:19:08,529 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:08,529 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:08,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:08,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:08,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:19:08,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:19:08,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:08,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:08,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:08,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:19:08,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:19:08,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:19:08,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:08,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:08,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:08,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:19:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:08,790 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:08,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:08,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:19:08,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:19:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:19:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:19:08,795 INFO L87 Difference]: Start difference. First operand 484 states and 775 transitions. Second operand 4 states. [2018-11-26 13:19:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:13,010 INFO L93 Difference]: Finished difference Result 1088 states and 1740 transitions. [2018-11-26 13:19:13,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:19:13,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-26 13:19:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:13,014 INFO L225 Difference]: With dead ends: 1088 [2018-11-26 13:19:13,014 INFO L226 Difference]: Without dead ends: 641 [2018-11-26 13:19:13,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:19:13,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-11-26 13:19:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 484. [2018-11-26 13:19:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-26 13:19:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 773 transitions. [2018-11-26 13:19:13,046 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 773 transitions. Word has length 78 [2018-11-26 13:19:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:13,047 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 773 transitions. [2018-11-26 13:19:13,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:19:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 773 transitions. [2018-11-26 13:19:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-26 13:19:13,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:13,048 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:19:13,048 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:13,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash -31147548, now seen corresponding path program 1 times [2018-11-26 13:19:13,049 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:13,049 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:13,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:13,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:13,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:19:13,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:19:13,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:13,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:19:13,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:13,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:19:13,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:19:13,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:13,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:19:13,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:13,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:13,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:19:13,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:19:13,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:19:13,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:19:13,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:13,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:19:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:13,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:13,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:13,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:19:13,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:19:13,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:19:13,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:19:13,548 INFO L87 Difference]: Start difference. First operand 484 states and 773 transitions. Second operand 6 states. [2018-11-26 13:19:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:17,536 INFO L93 Difference]: Finished difference Result 973 states and 1558 transitions. [2018-11-26 13:19:17,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:19:17,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-26 13:19:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:17,541 INFO L225 Difference]: With dead ends: 973 [2018-11-26 13:19:17,542 INFO L226 Difference]: Without dead ends: 526 [2018-11-26 13:19:17,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:19:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-11-26 13:19:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 485. [2018-11-26 13:19:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-11-26 13:19:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 774 transitions. [2018-11-26 13:19:17,575 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 774 transitions. Word has length 78 [2018-11-26 13:19:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:17,575 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 774 transitions. [2018-11-26 13:19:17,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:19:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 774 transitions. [2018-11-26 13:19:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-26 13:19:17,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:17,576 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:19:17,576 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:17,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash 503998498, now seen corresponding path program 1 times [2018-11-26 13:19:17,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:17,577 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:17,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:18,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:18,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:19:18,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:19:18,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:18,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:19:18,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:18,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:19:18,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:19:18,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:18,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:19:18,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:18,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:18,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:19:18,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:19:18,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:19:18,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:19:18,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:18,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:19:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:18,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:18,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:18,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:19:18,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:19:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:19:18,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:19:18,164 INFO L87 Difference]: Start difference. First operand 485 states and 774 transitions. Second operand 6 states. [2018-11-26 13:19:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:21,161 INFO L93 Difference]: Finished difference Result 971 states and 1554 transitions. [2018-11-26 13:19:21,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:19:21,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-26 13:19:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:21,167 INFO L225 Difference]: With dead ends: 971 [2018-11-26 13:19:21,167 INFO L226 Difference]: Without dead ends: 524 [2018-11-26 13:19:21,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:19:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-11-26 13:19:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 485. [2018-11-26 13:19:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-11-26 13:19:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 773 transitions. [2018-11-26 13:19:21,199 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 773 transitions. Word has length 78 [2018-11-26 13:19:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:21,200 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 773 transitions. [2018-11-26 13:19:21,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:19:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 773 transitions. [2018-11-26 13:19:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-26 13:19:21,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:21,201 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:19:21,202 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:21,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1494509467, now seen corresponding path program 1 times [2018-11-26 13:19:21,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:21,203 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:21,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:21,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:19:21,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:19:21,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:21,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:21,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:21,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:19:21,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:19:21,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:19:21,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:21,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:21,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:21,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:19:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:21,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:21,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:21,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:19:21,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:19:21,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:19:21,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:19:21,446 INFO L87 Difference]: Start difference. First operand 485 states and 773 transitions. Second operand 4 states. [2018-11-26 13:19:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:26,062 INFO L93 Difference]: Finished difference Result 1089 states and 1736 transitions. [2018-11-26 13:19:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:19:26,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-26 13:19:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:26,067 INFO L225 Difference]: With dead ends: 1089 [2018-11-26 13:19:26,067 INFO L226 Difference]: Without dead ends: 642 [2018-11-26 13:19:26,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:19:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-26 13:19:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 485. [2018-11-26 13:19:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-11-26 13:19:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 771 transitions. [2018-11-26 13:19:26,104 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 771 transitions. Word has length 79 [2018-11-26 13:19:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:26,104 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 771 transitions. [2018-11-26 13:19:26,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:19:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 771 transitions. [2018-11-26 13:19:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-26 13:19:26,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:26,105 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:19:26,105 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:26,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:26,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1001313206, now seen corresponding path program 1 times [2018-11-26 13:19:26,106 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:26,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:26,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:26,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:26,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:19:26,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:19:26,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:26,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:26,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:19:26,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,644 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:19:26,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:19:26,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:26,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:19:26,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:19:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:26,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:19:26,726 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:19:26,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:26,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-26 13:19:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:26,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:19:26,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-26 13:19:26,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:19:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:19:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:19:26,739 INFO L87 Difference]: Start difference. First operand 485 states and 771 transitions. Second operand 9 states. [2018-11-26 13:19:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:39,470 INFO L93 Difference]: Finished difference Result 1264 states and 2007 transitions. [2018-11-26 13:19:39,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:19:39,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-26 13:19:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:39,475 INFO L225 Difference]: With dead ends: 1264 [2018-11-26 13:19:39,475 INFO L226 Difference]: Without dead ends: 817 [2018-11-26 13:19:39,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:19:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-11-26 13:19:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 517. [2018-11-26 13:19:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-11-26 13:19:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 821 transitions. [2018-11-26 13:19:39,514 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 821 transitions. Word has length 79 [2018-11-26 13:19:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:39,514 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 821 transitions. [2018-11-26 13:19:39,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:19:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 821 transitions. [2018-11-26 13:19:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-26 13:19:39,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:39,516 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:19:39,516 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:39,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash -326784469, now seen corresponding path program 1 times [2018-11-26 13:19:39,517 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:39,517 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:39,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:40,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:40,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:19:40,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:19:40,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:40,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:19:40,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:40,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:19:40,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:19:40,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:40,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:19:40,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:40,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:40,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:19:40,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:19:40,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:19:40,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:19:40,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:40,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:19:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:40,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:40,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:40,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:19:40,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:19:40,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:19:40,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:19:40,181 INFO L87 Difference]: Start difference. First operand 517 states and 821 transitions. Second operand 6 states. [2018-11-26 13:19:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:43,873 INFO L93 Difference]: Finished difference Result 1035 states and 1649 transitions. [2018-11-26 13:19:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:19:43,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-26 13:19:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:43,879 INFO L225 Difference]: With dead ends: 1035 [2018-11-26 13:19:43,879 INFO L226 Difference]: Without dead ends: 556 [2018-11-26 13:19:43,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:19:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-11-26 13:19:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 517. [2018-11-26 13:19:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-11-26 13:19:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 820 transitions. [2018-11-26 13:19:43,918 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 820 transitions. Word has length 79 [2018-11-26 13:19:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:43,918 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 820 transitions. [2018-11-26 13:19:43,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:19:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 820 transitions. [2018-11-26 13:19:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-26 13:19:43,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:43,919 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:19:43,919 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:43,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:43,919 INFO L82 PathProgramCache]: Analyzing trace with hash 460260909, now seen corresponding path program 1 times [2018-11-26 13:19:43,920 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:43,920 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:43,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:44,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:44,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:19:44,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:19:44,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:44,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:44,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:44,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:19:44,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:19:44,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:19:44,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:44,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:44,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:44,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:19:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:44,151 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:19:44,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:19:44,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:19:44,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:19:44,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:19:44,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:19:44,154 INFO L87 Difference]: Start difference. First operand 517 states and 820 transitions. Second operand 4 states. [2018-11-26 13:19:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:19:48,269 INFO L93 Difference]: Finished difference Result 1153 states and 1831 transitions. [2018-11-26 13:19:48,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:19:48,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-26 13:19:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:19:48,276 INFO L225 Difference]: With dead ends: 1153 [2018-11-26 13:19:48,276 INFO L226 Difference]: Without dead ends: 674 [2018-11-26 13:19:48,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:19:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-11-26 13:19:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 517. [2018-11-26 13:19:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-11-26 13:19:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 818 transitions. [2018-11-26 13:19:48,314 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 818 transitions. Word has length 80 [2018-11-26 13:19:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:19:48,314 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 818 transitions. [2018-11-26 13:19:48,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:19:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 818 transitions. [2018-11-26 13:19:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-26 13:19:48,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:19:48,315 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:19:48,316 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:19:48,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:19:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1980477619, now seen corresponding path program 1 times [2018-11-26 13:19:48,316 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:19:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:19:48,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:19:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:19:48,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:19:48,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:19:48,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:19:48,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:48,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:48,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:19:48,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,854 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:19:48,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:19:48,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:19:48,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:19:48,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:19:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:48,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:19:48,935 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:19:48,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:19:48,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-26 13:19:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:19:48,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:19:48,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-26 13:19:48,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:19:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:19:48,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:19:48,946 INFO L87 Difference]: Start difference. First operand 517 states and 818 transitions. Second operand 9 states. [2018-11-26 13:20:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:00,767 INFO L93 Difference]: Finished difference Result 1294 states and 2045 transitions. [2018-11-26 13:20:00,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:20:00,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-11-26 13:20:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:00,772 INFO L225 Difference]: With dead ends: 1294 [2018-11-26 13:20:00,772 INFO L226 Difference]: Without dead ends: 815 [2018-11-26 13:20:00,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:20:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-11-26 13:20:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 513. [2018-11-26 13:20:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-26 13:20:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 808 transitions. [2018-11-26 13:20:00,813 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 808 transitions. Word has length 80 [2018-11-26 13:20:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:00,814 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 808 transitions. [2018-11-26 13:20:00,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:20:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 808 transitions. [2018-11-26 13:20:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-26 13:20:00,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:00,815 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:20:00,815 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:00,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:00,815 INFO L82 PathProgramCache]: Analyzing trace with hash -623649920, now seen corresponding path program 1 times [2018-11-26 13:20:00,816 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:00,816 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:01,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:01,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:20:01,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:20:01,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:01,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:20:01,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:01,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:20:01,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:20:01,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:01,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:20:01,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:01,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:01,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:20:01,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:20:01,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:20:01,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:20:01,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:01,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:20:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:01,519 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:20:01,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:20:01,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:20:01,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:20:01,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:20:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:20:01,525 INFO L87 Difference]: Start difference. First operand 513 states and 808 transitions. Second operand 6 states. [2018-11-26 13:20:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:04,045 INFO L93 Difference]: Finished difference Result 1019 states and 1611 transitions. [2018-11-26 13:20:04,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:20:04,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-26 13:20:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:04,051 INFO L225 Difference]: With dead ends: 1019 [2018-11-26 13:20:04,051 INFO L226 Difference]: Without dead ends: 544 [2018-11-26 13:20:04,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:20:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-11-26 13:20:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 513. [2018-11-26 13:20:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-26 13:20:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 807 transitions. [2018-11-26 13:20:04,090 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 807 transitions. Word has length 80 [2018-11-26 13:20:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:04,091 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 807 transitions. [2018-11-26 13:20:04,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:20:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 807 transitions. [2018-11-26 13:20:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-26 13:20:04,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:04,092 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:20:04,092 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:04,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash -13870394, now seen corresponding path program 1 times [2018-11-26 13:20:04,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:04,093 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:04,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:04,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:20:04,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:20:04,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:04,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:04,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:04,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:20:04,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:20:04,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:20:04,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:04,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:04,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:04,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:20:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:04,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:20:04,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:20:04,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:20:04,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:20:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:20:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:20:04,361 INFO L87 Difference]: Start difference. First operand 513 states and 807 transitions. Second operand 4 states. [2018-11-26 13:20:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:09,395 INFO L93 Difference]: Finished difference Result 963 states and 1514 transitions. [2018-11-26 13:20:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:20:09,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-26 13:20:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:09,400 INFO L225 Difference]: With dead ends: 963 [2018-11-26 13:20:09,401 INFO L226 Difference]: Without dead ends: 718 [2018-11-26 13:20:09,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:20:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-11-26 13:20:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 545. [2018-11-26 13:20:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-11-26 13:20:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 859 transitions. [2018-11-26 13:20:09,443 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 859 transitions. Word has length 80 [2018-11-26 13:20:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:09,443 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 859 transitions. [2018-11-26 13:20:09,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:20:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 859 transitions. [2018-11-26 13:20:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:20:09,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:09,445 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:20:09,445 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:09,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1481538240, now seen corresponding path program 1 times [2018-11-26 13:20:09,446 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:09,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:09,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:09,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:20:09,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:20:09,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:09,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:09,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:09,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:20:09,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:20:09,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:20:09,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:09,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:09,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:09,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:20:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:09,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:20:09,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:20:09,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:20:09,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:20:09,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:20:09,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:20:09,758 INFO L87 Difference]: Start difference. First operand 545 states and 859 transitions. Second operand 4 states. [2018-11-26 13:20:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:13,264 INFO L93 Difference]: Finished difference Result 1195 states and 1892 transitions. [2018-11-26 13:20:13,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:20:13,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-26 13:20:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:13,270 INFO L225 Difference]: With dead ends: 1195 [2018-11-26 13:20:13,270 INFO L226 Difference]: Without dead ends: 688 [2018-11-26 13:20:13,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:20:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-11-26 13:20:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 547. [2018-11-26 13:20:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-11-26 13:20:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 861 transitions. [2018-11-26 13:20:13,331 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 861 transitions. Word has length 81 [2018-11-26 13:20:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:13,331 INFO L480 AbstractCegarLoop]: Abstraction has 547 states and 861 transitions. [2018-11-26 13:20:13,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:20:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 861 transitions. [2018-11-26 13:20:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:20:13,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:13,333 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:20:13,333 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:13,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash 811314439, now seen corresponding path program 1 times [2018-11-26 13:20:13,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:13,334 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:13,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:13,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:20:13,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:20:13,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:13,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:13,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:20:13,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,889 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:20:13,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:20:13,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:13,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:20:13,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:20:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:13,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:20:13,966 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:20:13,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:13,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-26 13:20:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:13,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:20:13,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-26 13:20:13,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:20:13,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:20:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:20:13,980 INFO L87 Difference]: Start difference. First operand 547 states and 861 transitions. Second operand 9 states. [2018-11-26 13:20:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:25,977 INFO L93 Difference]: Finished difference Result 1352 states and 2127 transitions. [2018-11-26 13:20:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:20:25,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-26 13:20:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:25,981 INFO L225 Difference]: With dead ends: 1352 [2018-11-26 13:20:25,982 INFO L226 Difference]: Without dead ends: 843 [2018-11-26 13:20:25,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:20:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-11-26 13:20:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 547. [2018-11-26 13:20:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-11-26 13:20:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 853 transitions. [2018-11-26 13:20:26,031 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 853 transitions. Word has length 81 [2018-11-26 13:20:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:26,032 INFO L480 AbstractCegarLoop]: Abstraction has 547 states and 853 transitions. [2018-11-26 13:20:26,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:20:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 853 transitions. [2018-11-26 13:20:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:20:26,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:26,033 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:20:26,034 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:26,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1848117477, now seen corresponding path program 1 times [2018-11-26 13:20:26,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:26,035 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:26,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:26,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:26,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:20:26,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:20:26,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:26,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:26,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:20:26,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,587 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,606 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:20:26,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:20:26,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:26,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:20:26,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:20:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:26,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:20:26,692 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:20:26,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:26,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-26 13:20:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:26,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:20:26,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-26 13:20:26,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:20:26,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:20:26,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:20:26,703 INFO L87 Difference]: Start difference. First operand 547 states and 853 transitions. Second operand 9 states. [2018-11-26 13:20:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:40,035 INFO L93 Difference]: Finished difference Result 1349 states and 2107 transitions. [2018-11-26 13:20:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:20:40,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-26 13:20:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:40,041 INFO L225 Difference]: With dead ends: 1349 [2018-11-26 13:20:40,041 INFO L226 Difference]: Without dead ends: 840 [2018-11-26 13:20:40,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:20:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-26 13:20:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 547. [2018-11-26 13:20:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-11-26 13:20:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 845 transitions. [2018-11-26 13:20:40,094 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 845 transitions. Word has length 81 [2018-11-26 13:20:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:40,094 INFO L480 AbstractCegarLoop]: Abstraction has 547 states and 845 transitions. [2018-11-26 13:20:40,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:20:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 845 transitions. [2018-11-26 13:20:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:20:40,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:40,095 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:20:40,096 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:40,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1914021932, now seen corresponding path program 1 times [2018-11-26 13:20:40,096 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:40,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:40,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:40,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:20:40,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:20:40,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:40,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:40,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:40,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:20:40,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:20:40,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:20:40,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:40,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:40,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:40,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:20:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:40,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:20:40,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:20:40,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:20:40,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:20:40,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:20:40,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:20:40,366 INFO L87 Difference]: Start difference. First operand 547 states and 845 transitions. Second operand 4 states. [2018-11-26 13:20:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:45,203 INFO L93 Difference]: Finished difference Result 968 states and 1500 transitions. [2018-11-26 13:20:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:20:45,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-26 13:20:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:45,209 INFO L225 Difference]: With dead ends: 968 [2018-11-26 13:20:45,209 INFO L226 Difference]: Without dead ends: 706 [2018-11-26 13:20:45,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:20:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-11-26 13:20:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 515. [2018-11-26 13:20:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-26 13:20:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 797 transitions. [2018-11-26 13:20:45,266 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 797 transitions. Word has length 81 [2018-11-26 13:20:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:45,267 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 797 transitions. [2018-11-26 13:20:45,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:20:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 797 transitions. [2018-11-26 13:20:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:20:45,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:45,268 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:20:45,268 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:45,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash -930626009, now seen corresponding path program 1 times [2018-11-26 13:20:45,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:45,269 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:45,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:45,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:45,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:20:45,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:20:45,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:45,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:20:45,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:45,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:20:45,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:20:45,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:45,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:20:45,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:45,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:45,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:20:45,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:20:45,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:20:45,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:20:45,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:45,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:20:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:45,775 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:20:45,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:20:45,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:20:45,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:20:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:20:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:20:45,779 INFO L87 Difference]: Start difference. First operand 515 states and 797 transitions. Second operand 6 states. [2018-11-26 13:20:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:48,132 INFO L93 Difference]: Finished difference Result 1023 states and 1590 transitions. [2018-11-26 13:20:48,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:20:48,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-26 13:20:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:48,138 INFO L225 Difference]: With dead ends: 1023 [2018-11-26 13:20:48,138 INFO L226 Difference]: Without dead ends: 546 [2018-11-26 13:20:48,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:20:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-26 13:20:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 516. [2018-11-26 13:20:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-26 13:20:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 798 transitions. [2018-11-26 13:20:48,184 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 798 transitions. Word has length 81 [2018-11-26 13:20:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:48,184 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 798 transitions. [2018-11-26 13:20:48,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:20:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 798 transitions. [2018-11-26 13:20:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-26 13:20:48,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:48,185 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-11-26 13:20:48,185 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:48,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash 970874919, now seen corresponding path program 1 times [2018-11-26 13:20:48,186 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:48,186 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:48,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:48,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:48,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:20:48,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:20:48,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:48,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:20:48,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:48,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:20:48,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:20:48,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:48,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:20:48,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:48,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:48,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:20:48,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:20:48,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:20:48,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:20:48,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:48,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:20:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:48,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:20:48,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:20:48,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:20:48,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:20:48,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:20:48,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:20:48,724 INFO L87 Difference]: Start difference. First operand 516 states and 798 transitions. Second operand 6 states. [2018-11-26 13:20:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:20:50,784 INFO L93 Difference]: Finished difference Result 1023 states and 1589 transitions. [2018-11-26 13:20:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:20:50,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-11-26 13:20:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:20:50,790 INFO L225 Difference]: With dead ends: 1023 [2018-11-26 13:20:50,790 INFO L226 Difference]: Without dead ends: 546 [2018-11-26 13:20:50,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:20:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-26 13:20:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 518. [2018-11-26 13:20:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-26 13:20:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 801 transitions. [2018-11-26 13:20:50,867 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 801 transitions. Word has length 81 [2018-11-26 13:20:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:20:50,867 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 801 transitions. [2018-11-26 13:20:50,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:20:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 801 transitions. [2018-11-26 13:20:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-26 13:20:50,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:20:50,869 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-26 13:20:50,869 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:20:50,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:20:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1626579856, now seen corresponding path program 1 times [2018-11-26 13:20:50,870 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:20:50,870 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:20:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:20:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:20:51,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:20:51,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:20:51,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:20:51,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:51,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:51,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:20:51,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,560 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:20:51,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:20:51,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:20:51,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:20:51,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:20:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:51,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:20:51,648 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:20:51,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:20:51,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-26 13:20:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:20:51,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:20:51,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-26 13:20:51,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:20:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:20:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:20:51,661 INFO L87 Difference]: Start difference. First operand 518 states and 801 transitions. Second operand 9 states. [2018-11-26 13:21:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:02,791 INFO L93 Difference]: Finished difference Result 1288 states and 1998 transitions. [2018-11-26 13:21:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:21:02,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-11-26 13:21:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:02,797 INFO L225 Difference]: With dead ends: 1288 [2018-11-26 13:21:02,797 INFO L226 Difference]: Without dead ends: 811 [2018-11-26 13:21:02,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:21:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-11-26 13:21:02,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 518. [2018-11-26 13:21:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-26 13:21:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 795 transitions. [2018-11-26 13:21:02,846 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 795 transitions. Word has length 82 [2018-11-26 13:21:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:02,846 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 795 transitions. [2018-11-26 13:21:02,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:21:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 795 transitions. [2018-11-26 13:21:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-26 13:21:02,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:02,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:21:02,848 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:02,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash 998145623, now seen corresponding path program 1 times [2018-11-26 13:21:02,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:02,848 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:02,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:03,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:03,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:21:03,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:21:03,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:03,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:21:03,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:03,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:21:03,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:21:03,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:03,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:21:03,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:03,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:03,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:21:03,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:21:03,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:21:03,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:21:03,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:03,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:21:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:03,353 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:03,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:03,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:21:03,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:21:03,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:21:03,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:21:03,359 INFO L87 Difference]: Start difference. First operand 518 states and 795 transitions. Second operand 6 states. [2018-11-26 13:21:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:06,154 INFO L93 Difference]: Finished difference Result 1019 states and 1571 transitions. [2018-11-26 13:21:06,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:21:06,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-26 13:21:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:06,159 INFO L225 Difference]: With dead ends: 1019 [2018-11-26 13:21:06,159 INFO L226 Difference]: Without dead ends: 542 [2018-11-26 13:21:06,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:21:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-11-26 13:21:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 518. [2018-11-26 13:21:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-26 13:21:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 794 transitions. [2018-11-26 13:21:06,207 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 794 transitions. Word has length 82 [2018-11-26 13:21:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:06,208 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 794 transitions. [2018-11-26 13:21:06,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:21:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 794 transitions. [2018-11-26 13:21:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-26 13:21:06,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:06,209 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-11-26 13:21:06,209 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:06,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1276529591, now seen corresponding path program 1 times [2018-11-26 13:21:06,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:06,210 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:06,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:06,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:06,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:21:06,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:21:06,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:06,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:21:06,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:06,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:21:06,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,574 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:21:06,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:06,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:21:06,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:06,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:06,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:21:06,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:21:06,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:21:06,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:21:06,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:06,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:21:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:06,677 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:06,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:06,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:21:06,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:21:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:21:06,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:21:06,681 INFO L87 Difference]: Start difference. First operand 518 states and 794 transitions. Second operand 6 states. [2018-11-26 13:21:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:09,274 INFO L93 Difference]: Finished difference Result 1017 states and 1568 transitions. [2018-11-26 13:21:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:21:09,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-26 13:21:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:09,280 INFO L225 Difference]: With dead ends: 1017 [2018-11-26 13:21:09,281 INFO L226 Difference]: Without dead ends: 540 [2018-11-26 13:21:09,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:21:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-26 13:21:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 519. [2018-11-26 13:21:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-11-26 13:21:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 795 transitions. [2018-11-26 13:21:09,333 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 795 transitions. Word has length 82 [2018-11-26 13:21:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:09,333 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 795 transitions. [2018-11-26 13:21:09,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:21:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 795 transitions. [2018-11-26 13:21:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-26 13:21:09,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:09,334 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:21:09,334 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:09,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:09,335 INFO L82 PathProgramCache]: Analyzing trace with hash 661046146, now seen corresponding path program 1 times [2018-11-26 13:21:09,335 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:09,335 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:09,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:09,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:09,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:21:09,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:21:09,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:09,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:09,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:21:09,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:21:09,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:21:09,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:09,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:21:09,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:21:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:09,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:21:09,996 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:21:09,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:09,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-26 13:21:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:10,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:21:10,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-26 13:21:10,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:21:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:21:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:21:10,009 INFO L87 Difference]: Start difference. First operand 519 states and 795 transitions. Second operand 9 states. [2018-11-26 13:21:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:20,738 INFO L93 Difference]: Finished difference Result 1289 states and 1985 transitions. [2018-11-26 13:21:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:21:20,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-11-26 13:21:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:20,743 INFO L225 Difference]: With dead ends: 1289 [2018-11-26 13:21:20,743 INFO L226 Difference]: Without dead ends: 812 [2018-11-26 13:21:20,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:21:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-11-26 13:21:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 519. [2018-11-26 13:21:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-11-26 13:21:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 789 transitions. [2018-11-26 13:21:20,800 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 789 transitions. Word has length 83 [2018-11-26 13:21:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:20,800 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 789 transitions. [2018-11-26 13:21:20,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:21:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 789 transitions. [2018-11-26 13:21:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-26 13:21:20,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:20,802 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-11-26 13:21:20,802 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:20,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash -536305950, now seen corresponding path program 1 times [2018-11-26 13:21:20,803 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:20,804 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:21,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:21,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:21:21,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:21:21,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:21,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:21:21,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:21,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:21:21,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:21:21,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:21,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:21:21,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:21,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:21,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:21:21,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:21:21,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:21:21,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:21:21,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:21,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:21:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:21,294 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:21,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:21,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:21:21,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:21:21,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:21:21,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:21:21,297 INFO L87 Difference]: Start difference. First operand 519 states and 789 transitions. Second operand 6 states. [2018-11-26 13:21:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:23,629 INFO L93 Difference]: Finished difference Result 1017 states and 1555 transitions. [2018-11-26 13:21:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:21:23,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-26 13:21:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:23,635 INFO L225 Difference]: With dead ends: 1017 [2018-11-26 13:21:23,635 INFO L226 Difference]: Without dead ends: 540 [2018-11-26 13:21:23,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:21:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-26 13:21:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 520. [2018-11-26 13:21:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-26 13:21:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 790 transitions. [2018-11-26 13:21:23,691 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 790 transitions. Word has length 83 [2018-11-26 13:21:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:23,692 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 790 transitions. [2018-11-26 13:21:23,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:21:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 790 transitions. [2018-11-26 13:21:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-26 13:21:23,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:23,693 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:21:23,694 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:23,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:23,694 INFO L82 PathProgramCache]: Analyzing trace with hash -884054005, now seen corresponding path program 1 times [2018-11-26 13:21:23,695 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:23,695 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:23,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:24,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:24,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:21:24,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:21:24,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:24,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:24,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:21:24,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:21:24,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:21:24,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:24,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:21:24,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:21:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:24,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:21:24,374 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:21:24,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:24,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-26 13:21:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:24,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:21:24,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-26 13:21:24,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:21:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:21:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:21:24,387 INFO L87 Difference]: Start difference. First operand 520 states and 790 transitions. Second operand 9 states. [2018-11-26 13:21:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:37,058 INFO L93 Difference]: Finished difference Result 1260 states and 1934 transitions. [2018-11-26 13:21:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-26 13:21:37,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-11-26 13:21:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:37,061 INFO L225 Difference]: With dead ends: 1260 [2018-11-26 13:21:37,061 INFO L226 Difference]: Without dead ends: 783 [2018-11-26 13:21:37,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-26 13:21:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-11-26 13:21:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 490. [2018-11-26 13:21:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-11-26 13:21:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 744 transitions. [2018-11-26 13:21:37,113 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 744 transitions. Word has length 84 [2018-11-26 13:21:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:37,114 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 744 transitions. [2018-11-26 13:21:37,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:21:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 744 transitions. [2018-11-26 13:21:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-26 13:21:37,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:37,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11-26 13:21:37,115 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:37,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash -483059246, now seen corresponding path program 1 times [2018-11-26 13:21:37,116 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:37,116 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:37,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:37,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:37,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:21:37,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:21:37,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:37,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:21:37,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:37,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:21:37,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:21:37,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:37,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:21:37,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:37,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:37,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:21:37,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:21:37,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:21:37,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:21:37,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:37,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:21:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:37,639 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:37,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:37,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:21:37,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:21:37,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:21:37,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:21:37,643 INFO L87 Difference]: Start difference. First operand 490 states and 744 transitions. Second operand 6 states. [2018-11-26 13:21:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:40,245 INFO L93 Difference]: Finished difference Result 955 states and 1460 transitions. [2018-11-26 13:21:40,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:21:40,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-11-26 13:21:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:40,248 INFO L225 Difference]: With dead ends: 955 [2018-11-26 13:21:40,249 INFO L226 Difference]: Without dead ends: 508 [2018-11-26 13:21:40,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:21:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-11-26 13:21:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 491. [2018-11-26 13:21:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-11-26 13:21:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 745 transitions. [2018-11-26 13:21:40,301 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 745 transitions. Word has length 84 [2018-11-26 13:21:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:40,301 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 745 transitions. [2018-11-26 13:21:40,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:21:40,301 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 745 transitions. [2018-11-26 13:21:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-26 13:21:40,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:40,302 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:21:40,303 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:40,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:40,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1422088218, now seen corresponding path program 1 times [2018-11-26 13:21:40,304 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:40,304 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:40,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:40,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:40,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:21:40,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:21:40,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:40,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:40,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:40,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:21:40,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:21:40,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:21:40,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:40,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:40,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:40,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:21:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:40,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:40,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:40,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:21:40,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:21:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:21:40,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:21:40,587 INFO L87 Difference]: Start difference. First operand 491 states and 745 transitions. Second operand 4 states. [2018-11-26 13:21:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:44,138 INFO L93 Difference]: Finished difference Result 1109 states and 1694 transitions. [2018-11-26 13:21:44,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:21:44,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-26 13:21:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:44,142 INFO L225 Difference]: With dead ends: 1109 [2018-11-26 13:21:44,142 INFO L226 Difference]: Without dead ends: 662 [2018-11-26 13:21:44,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:21:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-11-26 13:21:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 535. [2018-11-26 13:21:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-26 13:21:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 807 transitions. [2018-11-26 13:21:44,205 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 807 transitions. Word has length 85 [2018-11-26 13:21:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:44,205 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 807 transitions. [2018-11-26 13:21:44,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:21:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 807 transitions. [2018-11-26 13:21:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-26 13:21:44,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:44,207 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:21:44,207 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:44,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash 649979436, now seen corresponding path program 1 times [2018-11-26 13:21:44,208 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:44,208 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:44,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:44,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:44,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:21:44,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:21:44,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:44,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:44,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:44,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:21:44,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:21:44,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:21:44,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:44,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:44,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:44,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:21:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:44,481 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:44,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:44,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:21:44,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:21:44,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:21:44,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:21:44,485 INFO L87 Difference]: Start difference. First operand 535 states and 807 transitions. Second operand 4 states. [2018-11-26 13:21:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:48,216 INFO L93 Difference]: Finished difference Result 1153 states and 1754 transitions. [2018-11-26 13:21:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:21:48,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-26 13:21:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:48,221 INFO L225 Difference]: With dead ends: 1153 [2018-11-26 13:21:48,222 INFO L226 Difference]: Without dead ends: 662 [2018-11-26 13:21:48,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:21:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-11-26 13:21:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 539. [2018-11-26 13:21:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-26 13:21:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 813 transitions. [2018-11-26 13:21:48,278 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 813 transitions. Word has length 85 [2018-11-26 13:21:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:48,278 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 813 transitions. [2018-11-26 13:21:48,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:21:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 813 transitions. [2018-11-26 13:21:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-26 13:21:48,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:48,279 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:21:48,279 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:48,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:48,280 INFO L82 PathProgramCache]: Analyzing trace with hash 906566119, now seen corresponding path program 1 times [2018-11-26 13:21:48,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:48,280 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:48,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:48,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:48,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:21:48,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:21:48,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:48,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:48,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:48,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:21:48,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:21:48,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:21:48,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:48,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:48,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:48,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:21:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:48,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:48,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:48,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:21:48,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:21:48,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:21:48,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:21:48,528 INFO L87 Difference]: Start difference. First operand 539 states and 813 transitions. Second operand 4 states. [2018-11-26 13:21:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:51,995 INFO L93 Difference]: Finished difference Result 1149 states and 1747 transitions. [2018-11-26 13:21:51,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:21:51,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-11-26 13:21:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:52,000 INFO L225 Difference]: With dead ends: 1149 [2018-11-26 13:21:52,000 INFO L226 Difference]: Without dead ends: 654 [2018-11-26 13:21:52,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:21:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-11-26 13:21:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 539. [2018-11-26 13:21:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-26 13:21:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 811 transitions. [2018-11-26 13:21:52,056 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 811 transitions. Word has length 86 [2018-11-26 13:21:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:52,056 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 811 transitions. [2018-11-26 13:21:52,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:21:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 811 transitions. [2018-11-26 13:21:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-26 13:21:52,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:52,057 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:21:52,058 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:52,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1357439129, now seen corresponding path program 1 times [2018-11-26 13:21:52,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:52,058 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 55 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:52,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:52,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:52,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:21:52,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:21:52,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:52,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:52,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:52,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:21:52,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:21:52,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:21:52,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:52,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:52,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:52,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:21:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:21:52,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:52,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:52,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:21:52,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:21:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:21:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:21:52,331 INFO L87 Difference]: Start difference. First operand 539 states and 811 transitions. Second operand 4 states. [2018-11-26 13:21:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:21:56,494 INFO L93 Difference]: Finished difference Result 1141 states and 1733 transitions. [2018-11-26 13:21:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:21:56,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-11-26 13:21:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:21:56,499 INFO L225 Difference]: With dead ends: 1141 [2018-11-26 13:21:56,499 INFO L226 Difference]: Without dead ends: 646 [2018-11-26 13:21:56,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:21:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-26 13:21:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 541. [2018-11-26 13:21:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-11-26 13:21:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 813 transitions. [2018-11-26 13:21:56,555 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 813 transitions. Word has length 86 [2018-11-26 13:21:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:21:56,555 INFO L480 AbstractCegarLoop]: Abstraction has 541 states and 813 transitions. [2018-11-26 13:21:56,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:21:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 813 transitions. [2018-11-26 13:21:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-26 13:21:56,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:21:56,556 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:21:56,556 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:21:56,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:21:56,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1973602915, now seen corresponding path program 1 times [2018-11-26 13:21:56,557 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:21:56,557 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 56 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:21:56,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:21:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:21:56,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:21:56,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:21:57,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:21:57,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-26 13:21:57,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-26 13:21:57,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:57,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:57,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:21:57,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-26 13:21:57,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:21:57,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:21:57,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:21:57,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:21:57,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:21:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:21:57,134 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:21:57,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:21:57,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:21:57,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:21:57,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:21:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:21:57,138 INFO L87 Difference]: Start difference. First operand 541 states and 813 transitions. Second operand 8 states. [2018-11-26 13:22:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:22:08,539 INFO L93 Difference]: Finished difference Result 985 states and 1487 transitions. [2018-11-26 13:22:08,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:22:08,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-11-26 13:22:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:22:08,543 INFO L225 Difference]: With dead ends: 985 [2018-11-26 13:22:08,543 INFO L226 Difference]: Without dead ends: 729 [2018-11-26 13:22:08,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:22:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-11-26 13:22:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 575. [2018-11-26 13:22:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-11-26 13:22:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 857 transitions. [2018-11-26 13:22:08,601 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 857 transitions. Word has length 88 [2018-11-26 13:22:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:22:08,601 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 857 transitions. [2018-11-26 13:22:08,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:22:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 857 transitions. [2018-11-26 13:22:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-26 13:22:08,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:22:08,602 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:22:08,603 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:22:08,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:22:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1897717659, now seen corresponding path program 1 times [2018-11-26 13:22:08,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:22:08,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 57 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:22:08,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:22:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:22:09,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:22:09,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:22:09,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:22:09,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-26 13:22:09,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-26 13:22:09,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:09,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:09,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:22:09,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-26 13:22:09,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:22:09,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:09,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:22:09,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:09,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:22:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:22:09,191 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:22:09,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:22:09,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:22:09,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:22:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:22:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:22:09,196 INFO L87 Difference]: Start difference. First operand 575 states and 857 transitions. Second operand 8 states. [2018-11-26 13:22:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:22:22,200 INFO L93 Difference]: Finished difference Result 1033 states and 1550 transitions. [2018-11-26 13:22:22,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:22:22,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-11-26 13:22:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:22:22,203 INFO L225 Difference]: With dead ends: 1033 [2018-11-26 13:22:22,204 INFO L226 Difference]: Without dead ends: 760 [2018-11-26 13:22:22,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:22:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-11-26 13:22:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 573. [2018-11-26 13:22:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-11-26 13:22:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 855 transitions. [2018-11-26 13:22:22,270 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 855 transitions. Word has length 88 [2018-11-26 13:22:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:22:22,270 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 855 transitions. [2018-11-26 13:22:22,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:22:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 855 transitions. [2018-11-26 13:22:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-26 13:22:22,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:22:22,272 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:22:22,272 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:22:22,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:22:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash 304100855, now seen corresponding path program 1 times [2018-11-26 13:22:22,273 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:22:22,274 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 58 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:22:22,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:22:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:22:22,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:22:22,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:22:22,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:22:22,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:22,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:22,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:22:22,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:22,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:22,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:22,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:22,789 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:22:22,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:22:22,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:22,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:22:22,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:22,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:22,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:22,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:22:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:22:22,843 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:22:22,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:22:22,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:22:22,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:22:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:22:22,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:22:22,849 INFO L87 Difference]: Start difference. First operand 573 states and 855 transitions. Second operand 7 states. [2018-11-26 13:22:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:22:33,008 INFO L93 Difference]: Finished difference Result 927 states and 1398 transitions. [2018-11-26 13:22:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:22:33,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-11-26 13:22:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:22:33,012 INFO L225 Difference]: With dead ends: 927 [2018-11-26 13:22:33,012 INFO L226 Difference]: Without dead ends: 659 [2018-11-26 13:22:33,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:22:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-26 13:22:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 597. [2018-11-26 13:22:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-11-26 13:22:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 890 transitions. [2018-11-26 13:22:33,075 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 890 transitions. Word has length 88 [2018-11-26 13:22:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:22:33,082 INFO L480 AbstractCegarLoop]: Abstraction has 597 states and 890 transitions. [2018-11-26 13:22:33,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:22:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 890 transitions. [2018-11-26 13:22:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-26 13:22:33,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:22:33,085 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:22:33,085 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:22:33,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:22:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash -898814929, now seen corresponding path program 1 times [2018-11-26 13:22:33,086 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:22:33,086 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 59 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:22:33,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:22:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:22:33,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:22:33,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:22:33,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:22:33,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-26 13:22:33,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-26 13:22:33,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:33,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:33,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:22:33,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-26 13:22:33,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:22:33,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:33,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:22:33,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:33,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:22:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:22:33,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:22:33,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:22:33,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:22:33,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:22:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:22:33,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:22:33,654 INFO L87 Difference]: Start difference. First operand 597 states and 890 transitions. Second operand 8 states. [2018-11-26 13:22:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:22:44,764 INFO L93 Difference]: Finished difference Result 1068 states and 1602 transitions. [2018-11-26 13:22:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:22:44,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2018-11-26 13:22:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:22:44,769 INFO L225 Difference]: With dead ends: 1068 [2018-11-26 13:22:44,769 INFO L226 Difference]: Without dead ends: 772 [2018-11-26 13:22:44,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:22:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-11-26 13:22:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 599. [2018-11-26 13:22:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-11-26 13:22:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 892 transitions. [2018-11-26 13:22:44,840 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 892 transitions. Word has length 89 [2018-11-26 13:22:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:22:44,840 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 892 transitions. [2018-11-26 13:22:44,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:22:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 892 transitions. [2018-11-26 13:22:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-26 13:22:44,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:22:44,841 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:22:44,841 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:22:44,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:22:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash -650668435, now seen corresponding path program 1 times [2018-11-26 13:22:44,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:22:44,842 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 60 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:22:44,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:22:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:22:45,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:22:45,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:22:45,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:22:45,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-26 13:22:45,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-26 13:22:45,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:45,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:45,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:22:45,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-26 13:22:45,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:22:45,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:45,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:22:45,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:45,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:22:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:22:45,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:22:45,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:22:45,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:22:45,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:22:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:22:45,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:22:45,452 INFO L87 Difference]: Start difference. First operand 599 states and 892 transitions. Second operand 8 states. [2018-11-26 13:22:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:22:58,267 INFO L93 Difference]: Finished difference Result 1037 states and 1561 transitions. [2018-11-26 13:22:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:22:58,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2018-11-26 13:22:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:22:58,271 INFO L225 Difference]: With dead ends: 1037 [2018-11-26 13:22:58,271 INFO L226 Difference]: Without dead ends: 740 [2018-11-26 13:22:58,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:22:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-11-26 13:22:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 565. [2018-11-26 13:22:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-11-26 13:22:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 848 transitions. [2018-11-26 13:22:58,343 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 848 transitions. Word has length 89 [2018-11-26 13:22:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:22:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 565 states and 848 transitions. [2018-11-26 13:22:58,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:22:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 848 transitions. [2018-11-26 13:22:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-26 13:22:58,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:22:58,344 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:22:58,344 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:22:58,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:22:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash -774862290, now seen corresponding path program 1 times [2018-11-26 13:22:58,345 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:22:58,345 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 61 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:22:58,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:22:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:22:58,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:22:58,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:22:58,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:22:58,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:58,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:58,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:22:58,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:58,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:58,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:58,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:58,847 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:22:58,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:22:58,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:22:58,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:22:58,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:22:58,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:58,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:22:58,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:22:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:22:58,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:22:58,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:22:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:22:58,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:22:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:22:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:22:58,905 INFO L87 Difference]: Start difference. First operand 565 states and 848 transitions. Second operand 7 states. [2018-11-26 13:23:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:10,069 INFO L93 Difference]: Finished difference Result 899 states and 1364 transitions. [2018-11-26 13:23:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:23:10,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-11-26 13:23:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:10,073 INFO L225 Difference]: With dead ends: 899 [2018-11-26 13:23:10,073 INFO L226 Difference]: Without dead ends: 623 [2018-11-26 13:23:10,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:23:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-11-26 13:23:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 564. [2018-11-26 13:23:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-11-26 13:23:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 847 transitions. [2018-11-26 13:23:10,138 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 847 transitions. Word has length 89 [2018-11-26 13:23:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:10,139 INFO L480 AbstractCegarLoop]: Abstraction has 564 states and 847 transitions. [2018-11-26 13:23:10,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:23:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 847 transitions. [2018-11-26 13:23:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-26 13:23:10,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:10,140 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:23:10,141 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:10,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2089048434, now seen corresponding path program 1 times [2018-11-26 13:23:10,142 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:10,142 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 62 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:10,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:10,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:10,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:23:10,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:23:10,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:10,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:10,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:10,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:23:10,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:23:10,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:23:10,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:10,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:10,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:10,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:23:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:10,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:10,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:10,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:23:10,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:23:10,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:23:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:23:10,452 INFO L87 Difference]: Start difference. First operand 564 states and 847 transitions. Second operand 4 states. [2018-11-26 13:23:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:13,544 INFO L93 Difference]: Finished difference Result 1191 states and 1803 transitions. [2018-11-26 13:23:13,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:23:13,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-26 13:23:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:13,549 INFO L225 Difference]: With dead ends: 1191 [2018-11-26 13:23:13,549 INFO L226 Difference]: Without dead ends: 671 [2018-11-26 13:23:13,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:23:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-26 13:23:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 576. [2018-11-26 13:23:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-11-26 13:23:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 867 transitions. [2018-11-26 13:23:13,612 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 867 transitions. Word has length 90 [2018-11-26 13:23:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:13,612 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 867 transitions. [2018-11-26 13:23:13,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:23:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 867 transitions. [2018-11-26 13:23:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-26 13:23:13,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:13,613 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:23:13,613 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:13,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash 950524353, now seen corresponding path program 1 times [2018-11-26 13:23:13,614 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:13,614 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 63 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:13,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:13,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:13,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:23:13,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:23:13,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:13,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:13,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:13,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:23:13,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:23:13,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:23:13,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:13,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:13,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:13,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:23:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:13,922 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:13,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:13,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:23:13,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:23:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:23:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:23:13,925 INFO L87 Difference]: Start difference. First operand 576 states and 867 transitions. Second operand 4 states. [2018-11-26 13:23:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:18,218 INFO L93 Difference]: Finished difference Result 1203 states and 1821 transitions. [2018-11-26 13:23:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:23:18,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-26 13:23:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:18,223 INFO L225 Difference]: With dead ends: 1203 [2018-11-26 13:23:18,224 INFO L226 Difference]: Without dead ends: 671 [2018-11-26 13:23:18,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:23:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-26 13:23:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 576. [2018-11-26 13:23:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-11-26 13:23:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 865 transitions. [2018-11-26 13:23:18,290 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 865 transitions. Word has length 91 [2018-11-26 13:23:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:18,291 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 865 transitions. [2018-11-26 13:23:18,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:23:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 865 transitions. [2018-11-26 13:23:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-26 13:23:18,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:18,293 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:23:18,293 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:18,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash -807310011, now seen corresponding path program 1 times [2018-11-26 13:23:18,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:18,294 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 64 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:18,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:18,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:23:18,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:23:18,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:18,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:18,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:18,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:23:18,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:23:18,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:23:18,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:18,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:18,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:18,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:23:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:18,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:18,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:23:18,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:23:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:23:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:23:18,626 INFO L87 Difference]: Start difference. First operand 576 states and 865 transitions. Second operand 4 states. [2018-11-26 13:23:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:21,963 INFO L93 Difference]: Finished difference Result 1199 states and 1813 transitions. [2018-11-26 13:23:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:23:21,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-26 13:23:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:21,967 INFO L225 Difference]: With dead ends: 1199 [2018-11-26 13:23:21,967 INFO L226 Difference]: Without dead ends: 667 [2018-11-26 13:23:21,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:23:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-26 13:23:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 578. [2018-11-26 13:23:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-26 13:23:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 867 transitions. [2018-11-26 13:23:22,031 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 867 transitions. Word has length 91 [2018-11-26 13:23:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:22,032 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 867 transitions. [2018-11-26 13:23:22,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:23:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 867 transitions. [2018-11-26 13:23:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-26 13:23:22,033 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:22,034 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:23:22,034 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:22,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1135134928, now seen corresponding path program 1 times [2018-11-26 13:23:22,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:22,035 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 65 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:22,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:22,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:22,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:23:22,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:23:22,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:22,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:22,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:22,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:23:22,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:23:22,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:23:22,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:22,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:22,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:22,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:23:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:22,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:22,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:22,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:23:22,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:23:22,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:23:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:23:22,318 INFO L87 Difference]: Start difference. First operand 578 states and 867 transitions. Second operand 4 states. [2018-11-26 13:23:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:25,557 INFO L93 Difference]: Finished difference Result 1195 states and 1805 transitions. [2018-11-26 13:23:25,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:23:25,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-26 13:23:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:25,561 INFO L225 Difference]: With dead ends: 1195 [2018-11-26 13:23:25,562 INFO L226 Difference]: Without dead ends: 661 [2018-11-26 13:23:25,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:23:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-11-26 13:23:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 580. [2018-11-26 13:23:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-26 13:23:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 869 transitions. [2018-11-26 13:23:25,627 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 869 transitions. Word has length 92 [2018-11-26 13:23:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:25,628 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 869 transitions. [2018-11-26 13:23:25,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:23:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 869 transitions. [2018-11-26 13:23:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-26 13:23:25,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:25,630 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:23:25,630 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:25,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1670280974, now seen corresponding path program 1 times [2018-11-26 13:23:25,631 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:25,631 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 66 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:25,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:25,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:25,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:23:25,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:23:25,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:25,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:25,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:25,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:23:25,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:23:25,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:23:25,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:25,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:25,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:25,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:23:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:25,904 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:25,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:25,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:23:25,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:23:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:23:25,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:23:25,908 INFO L87 Difference]: Start difference. First operand 580 states and 869 transitions. Second operand 4 states. [2018-11-26 13:23:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:28,769 INFO L93 Difference]: Finished difference Result 1193 states and 1799 transitions. [2018-11-26 13:23:28,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:23:28,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-26 13:23:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:28,773 INFO L225 Difference]: With dead ends: 1193 [2018-11-26 13:23:28,773 INFO L226 Difference]: Without dead ends: 657 [2018-11-26 13:23:28,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:23:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-26 13:23:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 580. [2018-11-26 13:23:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-26 13:23:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 867 transitions. [2018-11-26 13:23:28,839 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 867 transitions. Word has length 92 [2018-11-26 13:23:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:28,839 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 867 transitions. [2018-11-26 13:23:28,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:23:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 867 transitions. [2018-11-26 13:23:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-26 13:23:28,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:28,841 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:23:28,841 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:28,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1468233919, now seen corresponding path program 1 times [2018-11-26 13:23:28,841 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:28,842 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 67 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:28,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:29,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:29,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:23:29,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:23:29,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:29,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:29,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:29,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:23:29,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:23:29,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:23:29,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:29,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:29,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:29,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:23:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:29,151 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:29,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:29,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:23:29,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:23:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:23:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:23:29,155 INFO L87 Difference]: Start difference. First operand 580 states and 867 transitions. Second operand 4 states. [2018-11-26 13:23:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:32,744 INFO L93 Difference]: Finished difference Result 1193 states and 1795 transitions. [2018-11-26 13:23:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:23:32,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-26 13:23:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:32,747 INFO L225 Difference]: With dead ends: 1193 [2018-11-26 13:23:32,747 INFO L226 Difference]: Without dead ends: 657 [2018-11-26 13:23:32,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:23:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-26 13:23:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 580. [2018-11-26 13:23:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-26 13:23:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 865 transitions. [2018-11-26 13:23:32,813 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 865 transitions. Word has length 93 [2018-11-26 13:23:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:32,813 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 865 transitions. [2018-11-26 13:23:32,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:23:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 865 transitions. [2018-11-26 13:23:32,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-26 13:23:32,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:32,814 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:23:32,815 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:32,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:32,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2019348345, now seen corresponding path program 1 times [2018-11-26 13:23:32,815 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:32,815 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 68 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:32,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:33,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:33,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:23:33,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:23:33,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:33,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:33,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:23:33,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:33,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:33,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:33,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:33,439 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:23:33,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:23:33,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:33,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:23:33,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:33,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:33,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:33,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:23:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:33,499 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:33,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:23:33,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:23:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:23:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:23:33,504 INFO L87 Difference]: Start difference. First operand 580 states and 865 transitions. Second operand 7 states. [2018-11-26 13:23:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:42,520 INFO L93 Difference]: Finished difference Result 921 states and 1388 transitions. [2018-11-26 13:23:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:23:42,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-26 13:23:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:42,524 INFO L225 Difference]: With dead ends: 921 [2018-11-26 13:23:42,524 INFO L226 Difference]: Without dead ends: 637 [2018-11-26 13:23:42,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:23:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-11-26 13:23:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 585. [2018-11-26 13:23:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-26 13:23:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 874 transitions. [2018-11-26 13:23:42,603 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 874 transitions. Word has length 93 [2018-11-26 13:23:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:42,603 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 874 transitions. [2018-11-26 13:23:42,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:23:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 874 transitions. [2018-11-26 13:23:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-26 13:23:42,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:42,605 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:23:42,605 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:42,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash -349265111, now seen corresponding path program 1 times [2018-11-26 13:23:42,606 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:42,606 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 69 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:42,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:43,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:43,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:23:43,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:23:43,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:43,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:23:43,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:43,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:23:43,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:23:43,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:43,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:23:43,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:43,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:43,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:23:43,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:23:43,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:23:43,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:23:43,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:43,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:23:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:43,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:43,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:43,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:23:43,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:23:43,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:23:43,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:23:43,268 INFO L87 Difference]: Start difference. First operand 585 states and 874 transitions. Second operand 6 states. [2018-11-26 13:23:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:45,328 INFO L93 Difference]: Finished difference Result 1143 states and 1717 transitions. [2018-11-26 13:23:45,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:23:45,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-26 13:23:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:45,333 INFO L225 Difference]: With dead ends: 1143 [2018-11-26 13:23:45,333 INFO L226 Difference]: Without dead ends: 602 [2018-11-26 13:23:45,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:23:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-26 13:23:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 588. [2018-11-26 13:23:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-26 13:23:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 877 transitions. [2018-11-26 13:23:45,399 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 877 transitions. Word has length 93 [2018-11-26 13:23:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:45,400 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 877 transitions. [2018-11-26 13:23:45,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:23:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 877 transitions. [2018-11-26 13:23:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-26 13:23:45,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:45,401 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:23:45,401 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:45,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:45,401 INFO L82 PathProgramCache]: Analyzing trace with hash -812654740, now seen corresponding path program 1 times [2018-11-26 13:23:45,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:45,402 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 70 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:45,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:45,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:45,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:23:45,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:23:45,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:45,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:45,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:45,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:23:45,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:23:45,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:23:45,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:45,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:45,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:45,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:23:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:45,692 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:45,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:45,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:23:45,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:23:45,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:23:45,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:23:45,696 INFO L87 Difference]: Start difference. First operand 588 states and 877 transitions. Second operand 4 states. [2018-11-26 13:23:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:47,930 INFO L93 Difference]: Finished difference Result 1190 states and 1786 transitions. [2018-11-26 13:23:47,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:23:47,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-26 13:23:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:47,933 INFO L225 Difference]: With dead ends: 1190 [2018-11-26 13:23:47,934 INFO L226 Difference]: Without dead ends: 649 [2018-11-26 13:23:47,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:23:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-26 13:23:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 588. [2018-11-26 13:23:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-26 13:23:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 875 transitions. [2018-11-26 13:23:47,999 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 875 transitions. Word has length 94 [2018-11-26 13:23:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:48,000 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 875 transitions. [2018-11-26 13:23:48,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:23:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 875 transitions. [2018-11-26 13:23:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-26 13:23:48,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:48,001 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:23:48,001 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:48,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1855724212, now seen corresponding path program 1 times [2018-11-26 13:23:48,002 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:48,002 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 71 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:48,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:48,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:48,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:23:48,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:23:48,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:48,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:48,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:23:48,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:48,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:48,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:48,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:48,657 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:23:48,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:23:48,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:48,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:23:48,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:48,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:48,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:48,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:23:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:48,710 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:48,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:48,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:23:48,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:23:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:23:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:23:48,715 INFO L87 Difference]: Start difference. First operand 588 states and 875 transitions. Second operand 7 states. [2018-11-26 13:23:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:23:56,938 INFO L93 Difference]: Finished difference Result 929 states and 1396 transitions. [2018-11-26 13:23:56,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:23:56,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-26 13:23:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:23:56,942 INFO L225 Difference]: With dead ends: 929 [2018-11-26 13:23:56,942 INFO L226 Difference]: Without dead ends: 640 [2018-11-26 13:23:56,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:23:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-11-26 13:23:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 588. [2018-11-26 13:23:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-26 13:23:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 874 transitions. [2018-11-26 13:23:57,016 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 874 transitions. Word has length 94 [2018-11-26 13:23:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:23:57,016 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 874 transitions. [2018-11-26 13:23:57,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:23:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 874 transitions. [2018-11-26 13:23:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-26 13:23:57,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:23:57,018 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:23:57,018 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:23:57,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:23:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash 681408720, now seen corresponding path program 1 times [2018-11-26 13:23:57,019 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:23:57,019 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 72 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:23:57,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:23:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:23:57,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:23:57,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:23:57,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:23:57,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:57,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:57,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:23:57,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:57,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:57,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:57,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:57,586 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:23:57,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:23:57,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:23:57,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:23:57,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:23:57,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:57,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:23:57,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:23:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:23:57,646 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:23:57,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:23:57,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:23:57,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:23:57,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:23:57,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:23:57,652 INFO L87 Difference]: Start difference. First operand 588 states and 874 transitions. Second operand 7 states. [2018-11-26 13:24:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:05,390 INFO L93 Difference]: Finished difference Result 927 states and 1392 transitions. [2018-11-26 13:24:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:24:05,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-26 13:24:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:05,394 INFO L225 Difference]: With dead ends: 927 [2018-11-26 13:24:05,394 INFO L226 Difference]: Without dead ends: 638 [2018-11-26 13:24:05,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:24:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-26 13:24:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 589. [2018-11-26 13:24:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2018-11-26 13:24:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 875 transitions. [2018-11-26 13:24:05,462 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 875 transitions. Word has length 94 [2018-11-26 13:24:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:05,463 INFO L480 AbstractCegarLoop]: Abstraction has 589 states and 875 transitions. [2018-11-26 13:24:05,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:24:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 875 transitions. [2018-11-26 13:24:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-26 13:24:05,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:05,464 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:24:05,465 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:05,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1549848359, now seen corresponding path program 1 times [2018-11-26 13:24:05,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 73 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:05,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:05,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:05,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:24:05,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:24:05,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:05,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:24:05,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:05,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:24:05,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:05,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:05,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:24:06,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:06,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:24:06,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:06,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:06,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:24:06,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:24:06,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:24:06,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:24:06,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:06,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:24:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:06,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:06,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:06,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:24:06,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:24:06,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:24:06,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:24:06,104 INFO L87 Difference]: Start difference. First operand 589 states and 875 transitions. Second operand 6 states. [2018-11-26 13:24:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:08,128 INFO L93 Difference]: Finished difference Result 1144 states and 1711 transitions. [2018-11-26 13:24:08,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:24:08,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-26 13:24:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:08,132 INFO L225 Difference]: With dead ends: 1144 [2018-11-26 13:24:08,132 INFO L226 Difference]: Without dead ends: 602 [2018-11-26 13:24:08,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:24:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-26 13:24:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 590. [2018-11-26 13:24:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-26 13:24:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 876 transitions. [2018-11-26 13:24:08,200 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 876 transitions. Word has length 94 [2018-11-26 13:24:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:08,201 INFO L480 AbstractCegarLoop]: Abstraction has 590 states and 876 transitions. [2018-11-26 13:24:08,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:24:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 876 transitions. [2018-11-26 13:24:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-26 13:24:08,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:08,202 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:24:08,203 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:08,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1800159163, now seen corresponding path program 1 times [2018-11-26 13:24:08,204 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:08,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 74 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:08,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:08,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:08,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:24:08,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:24:08,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:08,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:08,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:08,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:24:08,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:24:08,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:24:08,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:08,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:08,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:08,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:24:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:08,488 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:08,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:08,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:24:08,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:24:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:24:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:24:08,493 INFO L87 Difference]: Start difference. First operand 590 states and 876 transitions. Second operand 4 states. [2018-11-26 13:24:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:11,497 INFO L93 Difference]: Finished difference Result 1193 states and 1783 transitions. [2018-11-26 13:24:11,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:24:11,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-26 13:24:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:11,501 INFO L225 Difference]: With dead ends: 1193 [2018-11-26 13:24:11,502 INFO L226 Difference]: Without dead ends: 651 [2018-11-26 13:24:11,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:24:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-11-26 13:24:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 592. [2018-11-26 13:24:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-26 13:24:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 878 transitions. [2018-11-26 13:24:11,570 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 878 transitions. Word has length 95 [2018-11-26 13:24:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:11,570 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 878 transitions. [2018-11-26 13:24:11,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:24:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 878 transitions. [2018-11-26 13:24:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-26 13:24:11,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:11,572 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-11-26 13:24:11,572 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:11,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash -593307205, now seen corresponding path program 1 times [2018-11-26 13:24:11,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 75 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:11,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:11,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:11,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:24:11,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:24:11,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:11,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:11,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:11,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:24:11,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:24:11,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:24:11,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:11,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:11,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:11,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:24:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:11,863 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:11,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:11,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:24:11,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:24:11,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:24:11,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:24:11,868 INFO L87 Difference]: Start difference. First operand 592 states and 878 transitions. Second operand 4 states. [2018-11-26 13:24:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:14,148 INFO L93 Difference]: Finished difference Result 1195 states and 1783 transitions. [2018-11-26 13:24:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:24:14,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-26 13:24:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:14,151 INFO L225 Difference]: With dead ends: 1195 [2018-11-26 13:24:14,151 INFO L226 Difference]: Without dead ends: 651 [2018-11-26 13:24:14,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:24:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-11-26 13:24:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 596. [2018-11-26 13:24:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-11-26 13:24:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 884 transitions. [2018-11-26 13:24:14,219 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 884 transitions. Word has length 95 [2018-11-26 13:24:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:14,219 INFO L480 AbstractCegarLoop]: Abstraction has 596 states and 884 transitions. [2018-11-26 13:24:14,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:24:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 884 transitions. [2018-11-26 13:24:14,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-26 13:24:14,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:14,220 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:24:14,221 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:14,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash 40775333, now seen corresponding path program 1 times [2018-11-26 13:24:14,221 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 76 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:14,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:14,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:14,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:24:14,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:24:14,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:14,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:14,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:24:14,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:14,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:14,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:14,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:14,685 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:24:14,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:24:14,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:14,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:24:14,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:14,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:14,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:14,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:24:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:14,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:14,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:14,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:24:14,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:24:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:24:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:24:14,748 INFO L87 Difference]: Start difference. First operand 596 states and 884 transitions. Second operand 7 states. [2018-11-26 13:24:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:23,072 INFO L93 Difference]: Finished difference Result 935 states and 1401 transitions. [2018-11-26 13:24:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:24:23,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-26 13:24:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:23,075 INFO L225 Difference]: With dead ends: 935 [2018-11-26 13:24:23,075 INFO L226 Difference]: Without dead ends: 642 [2018-11-26 13:24:23,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:24:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-26 13:24:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 597. [2018-11-26 13:24:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-11-26 13:24:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 885 transitions. [2018-11-26 13:24:23,142 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 885 transitions. Word has length 95 [2018-11-26 13:24:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:23,143 INFO L480 AbstractCegarLoop]: Abstraction has 597 states and 885 transitions. [2018-11-26 13:24:23,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:24:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 885 transitions. [2018-11-26 13:24:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-26 13:24:23,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:23,144 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:24:23,144 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:23,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash 575921379, now seen corresponding path program 1 times [2018-11-26 13:24:23,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:23,145 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 77 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:23,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:23,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:23,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:24:23,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:24:23,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:23,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:23,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:24:23,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:23,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:23,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:23,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:23,728 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:24:23,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:24:23,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:23,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:24:23,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:23,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:23,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:23,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:24:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:23,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:23,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:23,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:24:23,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:24:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:24:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:24:23,790 INFO L87 Difference]: Start difference. First operand 597 states and 885 transitions. Second operand 7 states. [2018-11-26 13:24:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:32,103 INFO L93 Difference]: Finished difference Result 934 states and 1398 transitions. [2018-11-26 13:24:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:24:32,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-26 13:24:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:32,106 INFO L225 Difference]: With dead ends: 934 [2018-11-26 13:24:32,106 INFO L226 Difference]: Without dead ends: 640 [2018-11-26 13:24:32,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:24:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-11-26 13:24:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 597. [2018-11-26 13:24:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-11-26 13:24:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 884 transitions. [2018-11-26 13:24:32,182 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 884 transitions. Word has length 95 [2018-11-26 13:24:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:32,182 INFO L480 AbstractCegarLoop]: Abstraction has 597 states and 884 transitions. [2018-11-26 13:24:32,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:24:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 884 transitions. [2018-11-26 13:24:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-26 13:24:32,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:32,184 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:24:32,184 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:32,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash -859161596, now seen corresponding path program 1 times [2018-11-26 13:24:32,185 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:32,185 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 78 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:32,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:32,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:32,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:24:32,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:24:32,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:32,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:24:32,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:32,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:24:32,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:24:32,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:32,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:24:32,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:32,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:32,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:24:32,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:24:32,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:24:32,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:24:32,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:32,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:24:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:32,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:32,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:32,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:24:32,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:24:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:24:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:24:32,810 INFO L87 Difference]: Start difference. First operand 597 states and 884 transitions. Second operand 6 states. [2018-11-26 13:24:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:34,817 INFO L93 Difference]: Finished difference Result 1158 states and 1726 transitions. [2018-11-26 13:24:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:24:34,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-26 13:24:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:34,821 INFO L225 Difference]: With dead ends: 1158 [2018-11-26 13:24:34,821 INFO L226 Difference]: Without dead ends: 609 [2018-11-26 13:24:34,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:24:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-11-26 13:24:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 598. [2018-11-26 13:24:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-26 13:24:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 885 transitions. [2018-11-26 13:24:34,898 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 885 transitions. Word has length 95 [2018-11-26 13:24:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:34,899 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 885 transitions. [2018-11-26 13:24:34,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:24:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 885 transitions. [2018-11-26 13:24:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-26 13:24:34,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:34,900 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:24:34,901 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:34,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:34,901 INFO L82 PathProgramCache]: Analyzing trace with hash -246859965, now seen corresponding path program 1 times [2018-11-26 13:24:34,902 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:34,902 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 79 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:34,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:35,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:35,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:24:35,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:24:35,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:35,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:35,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:35,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:24:35,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:24:35,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:24:35,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:35,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:35,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:35,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:24:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:35,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:35,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:35,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:24:35,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:24:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:24:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:24:35,187 INFO L87 Difference]: Start difference. First operand 598 states and 885 transitions. Second operand 4 states. [2018-11-26 13:24:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:38,177 INFO L93 Difference]: Finished difference Result 1194 states and 1778 transitions. [2018-11-26 13:24:38,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:24:38,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-26 13:24:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:38,181 INFO L225 Difference]: With dead ends: 1194 [2018-11-26 13:24:38,181 INFO L226 Difference]: Without dead ends: 645 [2018-11-26 13:24:38,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:24:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-11-26 13:24:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 598. [2018-11-26 13:24:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-26 13:24:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 883 transitions. [2018-11-26 13:24:38,253 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 883 transitions. Word has length 96 [2018-11-26 13:24:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:38,253 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 883 transitions. [2018-11-26 13:24:38,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:24:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 883 transitions. [2018-11-26 13:24:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-26 13:24:38,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:38,254 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-11-26 13:24:38,255 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:38,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash 31524003, now seen corresponding path program 1 times [2018-11-26 13:24:38,256 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:38,256 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 80 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:38,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:38,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:38,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:24:38,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:24:38,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:38,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:38,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:38,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:24:38,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:24:38,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:24:38,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:38,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:38,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:38,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:24:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:38,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:38,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:38,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:24:38,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:24:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:24:38,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:24:38,551 INFO L87 Difference]: Start difference. First operand 598 states and 883 transitions. Second operand 4 states. [2018-11-26 13:24:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:41,435 INFO L93 Difference]: Finished difference Result 1190 states and 1770 transitions. [2018-11-26 13:24:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:24:41,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-26 13:24:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:41,440 INFO L225 Difference]: With dead ends: 1190 [2018-11-26 13:24:41,441 INFO L226 Difference]: Without dead ends: 641 [2018-11-26 13:24:41,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:24:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-11-26 13:24:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 600. [2018-11-26 13:24:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-26 13:24:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 885 transitions. [2018-11-26 13:24:41,519 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 885 transitions. Word has length 96 [2018-11-26 13:24:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:41,520 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 885 transitions. [2018-11-26 13:24:41,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:24:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 885 transitions. [2018-11-26 13:24:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-26 13:24:41,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:41,521 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:24:41,522 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:41,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:41,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1902824842, now seen corresponding path program 1 times [2018-11-26 13:24:41,523 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:41,523 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 81 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:41,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:42,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:42,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:24:42,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:24:42,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:42,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:42,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:24:42,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:42,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:42,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:42,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:42,212 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:24:42,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:24:42,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:42,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:24:42,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:42,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:42,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:42,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:24:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:42,270 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:42,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:42,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:24:42,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:24:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:24:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:24:42,277 INFO L87 Difference]: Start difference. First operand 600 states and 885 transitions. Second operand 7 states. [2018-11-26 13:24:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:50,522 INFO L93 Difference]: Finished difference Result 938 states and 1397 transitions. [2018-11-26 13:24:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:24:50,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-26 13:24:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:50,526 INFO L225 Difference]: With dead ends: 938 [2018-11-26 13:24:50,526 INFO L226 Difference]: Without dead ends: 643 [2018-11-26 13:24:50,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:24:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-26 13:24:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 600. [2018-11-26 13:24:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-26 13:24:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 884 transitions. [2018-11-26 13:24:50,605 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 884 transitions. Word has length 96 [2018-11-26 13:24:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:50,606 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 884 transitions. [2018-11-26 13:24:50,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:24:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 884 transitions. [2018-11-26 13:24:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-26 13:24:50,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:50,607 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:24:50,607 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:50,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1240680724, now seen corresponding path program 1 times [2018-11-26 13:24:50,608 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:50,608 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 82 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:50,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:51,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:51,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:24:51,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:24:51,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:51,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:24:51,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:51,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-26 13:24:51,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2018-11-26 13:24:51,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:51,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-26 13:24:51,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:51,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:51,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-26 13:24:51,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2018-11-26 13:24:51,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-26 13:24:51,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-26 13:24:51,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:51,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-26 13:24:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:51,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:51,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:51,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-26 13:24:51,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-26 13:24:51,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-26 13:24:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-26 13:24:51,224 INFO L87 Difference]: Start difference. First operand 600 states and 884 transitions. Second operand 6 states. [2018-11-26 13:24:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:53,055 INFO L93 Difference]: Finished difference Result 1156 states and 1717 transitions. [2018-11-26 13:24:53,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-26 13:24:53,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-26 13:24:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:53,059 INFO L225 Difference]: With dead ends: 1156 [2018-11-26 13:24:53,059 INFO L226 Difference]: Without dead ends: 582 [2018-11-26 13:24:53,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:24:53,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-11-26 13:24:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 578. [2018-11-26 13:24:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-26 13:24:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 861 transitions. [2018-11-26 13:24:53,128 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 861 transitions. Word has length 96 [2018-11-26 13:24:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:53,128 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 861 transitions. [2018-11-26 13:24:53,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-26 13:24:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 861 transitions. [2018-11-26 13:24:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-26 13:24:53,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:53,129 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:24:53,130 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:53,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash -476773514, now seen corresponding path program 1 times [2018-11-26 13:24:53,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 83 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:53,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:53,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:53,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:24:53,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:24:53,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:53,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:53,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:53,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:24:53,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:24:53,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:24:53,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:53,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:53,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:53,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:24:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:53,402 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:53,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:53,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:24:53,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:24:53,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:24:53,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:24:53,406 INFO L87 Difference]: Start difference. First operand 578 states and 861 transitions. Second operand 4 states. [2018-11-26 13:24:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:24:55,971 INFO L93 Difference]: Finished difference Result 1170 states and 1745 transitions. [2018-11-26 13:24:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:24:55,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-11-26 13:24:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:24:55,974 INFO L225 Difference]: With dead ends: 1170 [2018-11-26 13:24:55,974 INFO L226 Difference]: Without dead ends: 619 [2018-11-26 13:24:55,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:24:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-26 13:24:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 580. [2018-11-26 13:24:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-26 13:24:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 863 transitions. [2018-11-26 13:24:56,053 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 863 transitions. Word has length 97 [2018-11-26 13:24:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:24:56,053 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 863 transitions. [2018-11-26 13:24:56,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:24:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 863 transitions. [2018-11-26 13:24:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-26 13:24:56,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:24:56,055 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:24:56,055 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:24:56,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:24:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash -225238015, now seen corresponding path program 1 times [2018-11-26 13:24:56,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:24:56,056 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 84 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:24:56,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:24:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:24:56,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:24:56,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:24:56,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:24:56,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:56,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:56,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:24:56,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:56,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:56,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:56,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:56,788 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:24:56,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:24:56,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:24:56,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:24:56,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:24:56,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:56,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:24:56,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:24:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:24:56,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:24:56,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:24:56,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:24:56,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:24:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:24:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:24:56,854 INFO L87 Difference]: Start difference. First operand 580 states and 863 transitions. Second operand 7 states. [2018-11-26 13:25:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:04,424 INFO L93 Difference]: Finished difference Result 911 states and 1362 transitions. [2018-11-26 13:25:04,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:25:04,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-11-26 13:25:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:04,429 INFO L225 Difference]: With dead ends: 911 [2018-11-26 13:25:04,429 INFO L226 Difference]: Without dead ends: 615 [2018-11-26 13:25:04,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:25:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-26 13:25:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 580. [2018-11-26 13:25:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-26 13:25:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 862 transitions. [2018-11-26 13:25:04,506 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 862 transitions. Word has length 97 [2018-11-26 13:25:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:04,506 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 862 transitions. [2018-11-26 13:25:04,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:25:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 862 transitions. [2018-11-26 13:25:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-26 13:25:04,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:04,507 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-11-26 13:25:04,508 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:04,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:04,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1362446270, now seen corresponding path program 1 times [2018-11-26 13:25:04,508 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:04,508 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 85 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:04,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:04,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:04,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:25:04,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:25:04,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:04,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:04,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:04,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:25:04,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:25:04,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:25:04,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:04,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:04,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:04,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:25:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:04,782 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:04,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:04,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:25:04,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:25:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:25:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:25:04,786 INFO L87 Difference]: Start difference. First operand 580 states and 862 transitions. Second operand 4 states. [2018-11-26 13:25:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:06,913 INFO L93 Difference]: Finished difference Result 1168 states and 1739 transitions. [2018-11-26 13:25:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:25:06,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-26 13:25:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:06,917 INFO L225 Difference]: With dead ends: 1168 [2018-11-26 13:25:06,917 INFO L226 Difference]: Without dead ends: 615 [2018-11-26 13:25:06,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:25:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-26 13:25:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 582. [2018-11-26 13:25:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-26 13:25:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 864 transitions. [2018-11-26 13:25:06,987 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 864 transitions. Word has length 98 [2018-11-26 13:25:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:06,987 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 864 transitions. [2018-11-26 13:25:06,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:25:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 864 transitions. [2018-11-26 13:25:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-26 13:25:06,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:06,988 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:25:06,989 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:06,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:06,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1464758842, now seen corresponding path program 1 times [2018-11-26 13:25:06,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:06,990 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 86 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:07,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:07,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:25:07,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:25:07,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:07,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:07,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:25:07,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:07,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:07,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:07,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:07,449 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:25:07,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:25:07,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:07,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:25:07,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:07,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:07,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:07,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:25:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:07,513 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:07,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:07,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:25:07,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:25:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:25:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:25:07,519 INFO L87 Difference]: Start difference. First operand 582 states and 864 transitions. Second operand 7 states. [2018-11-26 13:25:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:14,709 INFO L93 Difference]: Finished difference Result 914 states and 1363 transitions. [2018-11-26 13:25:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:25:14,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-26 13:25:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:14,712 INFO L225 Difference]: With dead ends: 914 [2018-11-26 13:25:14,712 INFO L226 Difference]: Without dead ends: 617 [2018-11-26 13:25:14,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:25:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-26 13:25:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 583. [2018-11-26 13:25:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-11-26 13:25:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 865 transitions. [2018-11-26 13:25:14,789 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 865 transitions. Word has length 98 [2018-11-26 13:25:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:14,790 INFO L480 AbstractCegarLoop]: Abstraction has 583 states and 865 transitions. [2018-11-26 13:25:14,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:25:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 865 transitions. [2018-11-26 13:25:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-26 13:25:14,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:14,791 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-11-26 13:25:14,792 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:14,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash 436742086, now seen corresponding path program 1 times [2018-11-26 13:25:14,793 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:14,793 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 87 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:14,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:15,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:15,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:25:15,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:25:15,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:15,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:15,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:25:15,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:15,260 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:15,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:15,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:15,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:25:15,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:25:15,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:15,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:25:15,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:15,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:15,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:15,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:25:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:15,340 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:15,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:15,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:25:15,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:25:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:25:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:25:15,345 INFO L87 Difference]: Start difference. First operand 583 states and 865 transitions. Second operand 7 states. [2018-11-26 13:25:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:21,897 INFO L93 Difference]: Finished difference Result 915 states and 1363 transitions. [2018-11-26 13:25:21,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:25:21,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-11-26 13:25:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:21,900 INFO L225 Difference]: With dead ends: 915 [2018-11-26 13:25:21,901 INFO L226 Difference]: Without dead ends: 617 [2018-11-26 13:25:21,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:25:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-26 13:25:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 585. [2018-11-26 13:25:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-26 13:25:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 868 transitions. [2018-11-26 13:25:21,978 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 868 transitions. Word has length 98 [2018-11-26 13:25:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:21,979 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 868 transitions. [2018-11-26 13:25:21,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:25:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 868 transitions. [2018-11-26 13:25:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-26 13:25:21,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:21,980 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:25:21,981 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:21,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:21,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1619896984, now seen corresponding path program 1 times [2018-11-26 13:25:21,982 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:21,982 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 88 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:21,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:22,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:22,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:25:22,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:25:22,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:22,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:22,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:25:22,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:22,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:22,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:22,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:22,480 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:25:22,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:25:22,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:22,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:25:22,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:22,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:22,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:22,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:25:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:22,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:22,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:22,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:25:22,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:25:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:25:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:25:22,546 INFO L87 Difference]: Start difference. First operand 585 states and 868 transitions. Second operand 7 states. [2018-11-26 13:25:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:28,854 INFO L93 Difference]: Finished difference Result 913 states and 1360 transitions. [2018-11-26 13:25:28,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:25:28,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-26 13:25:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:28,858 INFO L225 Difference]: With dead ends: 913 [2018-11-26 13:25:28,859 INFO L226 Difference]: Without dead ends: 613 [2018-11-26 13:25:28,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:25:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-11-26 13:25:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 585. [2018-11-26 13:25:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-26 13:25:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 867 transitions. [2018-11-26 13:25:28,930 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 867 transitions. Word has length 99 [2018-11-26 13:25:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:28,930 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 867 transitions. [2018-11-26 13:25:28,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:25:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 867 transitions. [2018-11-26 13:25:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-26 13:25:28,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:28,932 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-11-26 13:25:28,932 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:28,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1898280952, now seen corresponding path program 1 times [2018-11-26 13:25:28,933 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:28,933 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 89 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:28,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:29,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:29,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:25:29,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:25:29,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:29,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:29,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:25:29,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:29,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:29,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:29,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:29,401 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:25:29,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:25:29,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:29,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:25:29,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:29,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:29,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:29,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:25:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:29,467 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:29,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:29,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:25:29,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:25:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:25:29,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:25:29,472 INFO L87 Difference]: Start difference. First operand 585 states and 867 transitions. Second operand 7 states. [2018-11-26 13:25:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:36,953 INFO L93 Difference]: Finished difference Result 911 states and 1356 transitions. [2018-11-26 13:25:36,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:25:36,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-26 13:25:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:36,958 INFO L225 Difference]: With dead ends: 911 [2018-11-26 13:25:36,958 INFO L226 Difference]: Without dead ends: 611 [2018-11-26 13:25:36,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:25:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-26 13:25:37,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2018-11-26 13:25:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-11-26 13:25:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 868 transitions. [2018-11-26 13:25:37,028 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 868 transitions. Word has length 99 [2018-11-26 13:25:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:37,029 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 868 transitions. [2018-11-26 13:25:37,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:25:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 868 transitions. [2018-11-26 13:25:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-26 13:25:37,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:37,030 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-11-26 13:25:37,030 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:37,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1558117057, now seen corresponding path program 1 times [2018-11-26 13:25:37,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:37,031 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 90 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:37,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:37,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:37,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:25:37,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:25:37,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:37,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:37,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:25:37,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:37,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:37,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:37,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:37,523 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:25:37,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:25:37,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:37,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:25:37,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:37,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:37,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:37,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:25:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:37,584 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:37,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:37,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:25:37,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:25:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:25:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:25:37,589 INFO L87 Difference]: Start difference. First operand 586 states and 868 transitions. Second operand 7 states. [2018-11-26 13:25:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:45,264 INFO L93 Difference]: Finished difference Result 912 states and 1356 transitions. [2018-11-26 13:25:45,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:25:45,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-11-26 13:25:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:45,268 INFO L225 Difference]: With dead ends: 912 [2018-11-26 13:25:45,268 INFO L226 Difference]: Without dead ends: 611 [2018-11-26 13:25:45,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:25:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-26 13:25:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 587. [2018-11-26 13:25:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-11-26 13:25:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 869 transitions. [2018-11-26 13:25:45,341 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 869 transitions. Word has length 100 [2018-11-26 13:25:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:45,342 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 869 transitions. [2018-11-26 13:25:45,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:25:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 869 transitions. [2018-11-26 13:25:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-26 13:25:45,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:45,344 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:25:45,344 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:45,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:45,344 INFO L82 PathProgramCache]: Analyzing trace with hash 19544531, now seen corresponding path program 1 times [2018-11-26 13:25:45,345 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:45,345 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 91 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:45,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:45,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:45,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:25:45,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:25:45,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:45,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:45,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:25:45,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:45,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:45,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:45,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:45,823 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:25:45,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:25:45,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:25:45,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:25:45,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:45,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:45,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:45,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:25:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:45,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:45,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:45,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:25:45,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:25:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:25:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:25:45,887 INFO L87 Difference]: Start difference. First operand 587 states and 869 transitions. Second operand 7 states. [2018-11-26 13:25:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:53,115 INFO L93 Difference]: Finished difference Result 911 states and 1354 transitions. [2018-11-26 13:25:53,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:25:53,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-26 13:25:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:53,119 INFO L225 Difference]: With dead ends: 911 [2018-11-26 13:25:53,119 INFO L226 Difference]: Without dead ends: 609 [2018-11-26 13:25:53,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:25:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-11-26 13:25:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 573. [2018-11-26 13:25:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-11-26 13:25:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 855 transitions. [2018-11-26 13:25:53,193 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 855 transitions. Word has length 101 [2018-11-26 13:25:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:53,194 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 855 transitions. [2018-11-26 13:25:53,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:25:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 855 transitions. [2018-11-26 13:25:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-26 13:25:53,195 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:53,196 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:25:53,196 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:53,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1506107069, now seen corresponding path program 1 times [2018-11-26 13:25:53,197 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 92 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:53,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:53,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:53,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:25:53,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:25:53,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:53,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:53,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:53,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:25:53,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:25:53,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:25:53,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:53,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:53,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:53,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:25:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:53,488 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:53,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:53,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:25:53,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:25:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:25:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:25:53,492 INFO L87 Difference]: Start difference. First operand 573 states and 855 transitions. Second operand 4 states. [2018-11-26 13:25:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:56,009 INFO L93 Difference]: Finished difference Result 1167 states and 1736 transitions. [2018-11-26 13:25:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:25:56,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-26 13:25:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:56,013 INFO L225 Difference]: With dead ends: 1167 [2018-11-26 13:25:56,013 INFO L226 Difference]: Without dead ends: 621 [2018-11-26 13:25:56,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:25:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-26 13:25:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 594. [2018-11-26 13:25:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-26 13:25:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2018-11-26 13:25:56,086 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 107 [2018-11-26 13:25:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:56,086 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2018-11-26 13:25:56,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:25:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2018-11-26 13:25:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-26 13:25:56,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:56,088 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:25:56,088 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:56,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash -942056488, now seen corresponding path program 1 times [2018-11-26 13:25:56,089 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:56,089 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 93 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:56,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:56,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:56,215 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:56,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:56,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-26 13:25:56,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-26 13:25:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-26 13:25:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-26 13:25:56,218 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand 3 states. [2018-11-26 13:25:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:56,419 INFO L93 Difference]: Finished difference Result 1199 states and 1779 transitions. [2018-11-26 13:25:56,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-26 13:25:56,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-11-26 13:25:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:56,421 INFO L225 Difference]: With dead ends: 1199 [2018-11-26 13:25:56,421 INFO L226 Difference]: Without dead ends: 893 [2018-11-26 13:25:56,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 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-11-26 13:25:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-11-26 13:25:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 887. [2018-11-26 13:25:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-11-26 13:25:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1305 transitions. [2018-11-26 13:25:56,540 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1305 transitions. Word has length 107 [2018-11-26 13:25:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:56,540 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1305 transitions. [2018-11-26 13:25:56,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-26 13:25:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1305 transitions. [2018-11-26 13:25:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-26 13:25:56,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:56,542 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:25:56,542 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:56,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash 132114373, now seen corresponding path program 1 times [2018-11-26 13:25:56,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:56,543 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 94 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:56,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:56,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:56,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:25:56,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:25:56,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:56,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:56,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:56,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:25:56,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:25:56,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:25:56,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:56,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:56,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:56,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:25:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:56,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:56,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:56,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:25:56,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:25:56,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:25:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:25:56,833 INFO L87 Difference]: Start difference. First operand 887 states and 1305 transitions. Second operand 4 states. [2018-11-26 13:25:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:25:58,956 INFO L93 Difference]: Finished difference Result 1785 states and 2626 transitions. [2018-11-26 13:25:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:25:58,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-26 13:25:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:25:58,960 INFO L225 Difference]: With dead ends: 1785 [2018-11-26 13:25:58,960 INFO L226 Difference]: Without dead ends: 925 [2018-11-26 13:25:58,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:25:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-26 13:25:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 890. [2018-11-26 13:25:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-11-26 13:25:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1308 transitions. [2018-11-26 13:25:59,067 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1308 transitions. Word has length 108 [2018-11-26 13:25:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:25:59,068 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1308 transitions. [2018-11-26 13:25:59,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:25:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1308 transitions. [2018-11-26 13:25:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-26 13:25:59,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:25:59,069 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:25:59,069 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:25:59,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:25:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash -257924456, now seen corresponding path program 1 times [2018-11-26 13:25:59,070 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:25:59,070 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 95 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:25:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:25:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:25:59,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:25:59,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:25:59,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:25:59,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:59,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:59,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:59,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:25:59,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:25:59,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:25:59,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:25:59,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:59,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:25:59,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:25:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:25:59,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:25:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:25:59,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:25:59,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:25:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:25:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:25:59,369 INFO L87 Difference]: Start difference. First operand 890 states and 1308 transitions. Second operand 4 states. [2018-11-26 13:26:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:01,703 INFO L93 Difference]: Finished difference Result 1788 states and 2626 transitions. [2018-11-26 13:26:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:26:01,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-26 13:26:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:01,708 INFO L225 Difference]: With dead ends: 1788 [2018-11-26 13:26:01,708 INFO L226 Difference]: Without dead ends: 925 [2018-11-26 13:26:01,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:26:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-26 13:26:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 893. [2018-11-26 13:26:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-11-26 13:26:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1311 transitions. [2018-11-26 13:26:01,816 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1311 transitions. Word has length 109 [2018-11-26 13:26:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:01,816 INFO L480 AbstractCegarLoop]: Abstraction has 893 states and 1311 transitions. [2018-11-26 13:26:01,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:26:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1311 transitions. [2018-11-26 13:26:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-26 13:26:01,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:01,819 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:26:01,819 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:01,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1595804416, now seen corresponding path program 1 times [2018-11-26 13:26:01,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 96 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:01,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:02,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:26:02,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:26:02,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:26:02,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:02,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:02,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:02,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-26 13:26:02,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:26:02,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-26 13:26:02,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:02,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:02,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:02,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-26 13:26:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:26:02,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:26:02,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:26:02,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-26 13:26:02,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-26 13:26:02,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-26 13:26:02,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-26 13:26:02,105 INFO L87 Difference]: Start difference. First operand 893 states and 1311 transitions. Second operand 4 states. [2018-11-26 13:26:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:04,368 INFO L93 Difference]: Finished difference Result 1560 states and 2274 transitions. [2018-11-26 13:26:04,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-26 13:26:04,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-26 13:26:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:04,372 INFO L225 Difference]: With dead ends: 1560 [2018-11-26 13:26:04,372 INFO L226 Difference]: Without dead ends: 625 [2018-11-26 13:26:04,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-26 13:26:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-11-26 13:26:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 601. [2018-11-26 13:26:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-26 13:26:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 896 transitions. [2018-11-26 13:26:04,453 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 896 transitions. Word has length 110 [2018-11-26 13:26:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:04,453 INFO L480 AbstractCegarLoop]: Abstraction has 601 states and 896 transitions. [2018-11-26 13:26:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-26 13:26:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 896 transitions. [2018-11-26 13:26:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-26 13:26:04,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:04,454 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:26:04,455 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:04,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1972686726, now seen corresponding path program 1 times [2018-11-26 13:26:04,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 97 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:04,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:04,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:26:04,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:26:04,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:26:04,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:04,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:04,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:26:04,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:04,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:04,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:04,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:04,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:26:05,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:26:05,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:05,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:26:05,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:05,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:05,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:05,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:26:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:26:05,049 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:26:05,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:26:05,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:26:05,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:26:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:26:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:26:05,054 INFO L87 Difference]: Start difference. First operand 601 states and 896 transitions. Second operand 7 states. [2018-11-26 13:26:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:15,447 INFO L93 Difference]: Finished difference Result 1346 states and 2015 transitions. [2018-11-26 13:26:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:26:15,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-11-26 13:26:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:15,450 INFO L225 Difference]: With dead ends: 1346 [2018-11-26 13:26:15,450 INFO L226 Difference]: Without dead ends: 783 [2018-11-26 13:26:15,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:26:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-11-26 13:26:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 633. [2018-11-26 13:26:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-26 13:26:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 938 transitions. [2018-11-26 13:26:15,539 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 938 transitions. Word has length 110 [2018-11-26 13:26:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:15,540 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 938 transitions. [2018-11-26 13:26:15,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:26:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 938 transitions. [2018-11-26 13:26:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-26 13:26:15,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:15,542 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:26:15,542 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:15,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash -750324664, now seen corresponding path program 1 times [2018-11-26 13:26:15,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:15,543 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 98 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:15,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:16,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:26:16,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:26:16,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:26:16,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:16,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:16,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:26:16,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:16,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:16,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:16,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:16,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:26:16,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:26:16,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:16,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:26:16,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:16,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:16,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:16,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:26:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:26:16,134 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:26:16,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:26:16,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:26:16,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:26:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:26:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:26:16,140 INFO L87 Difference]: Start difference. First operand 633 states and 938 transitions. Second operand 7 states. [2018-11-26 13:26:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:23,733 INFO L93 Difference]: Finished difference Result 1268 states and 1880 transitions. [2018-11-26 13:26:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:26:23,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-11-26 13:26:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:23,736 INFO L225 Difference]: With dead ends: 1268 [2018-11-26 13:26:23,736 INFO L226 Difference]: Without dead ends: 673 [2018-11-26 13:26:23,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:26:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-26 13:26:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 639. [2018-11-26 13:26:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-11-26 13:26:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 944 transitions. [2018-11-26 13:26:23,819 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 944 transitions. Word has length 110 [2018-11-26 13:26:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:23,819 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 944 transitions. [2018-11-26 13:26:23,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:26:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 944 transitions. [2018-11-26 13:26:23,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-26 13:26:23,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:23,821 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:26:23,821 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:23,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1320257784, now seen corresponding path program 1 times [2018-11-26 13:26:23,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:23,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 99 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:23,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:24,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:26:24,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:26:24,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:26:24,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:24,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:24,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:26:24,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:24,350 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:24,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:24,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:24,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:26:24,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:26:24,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:24,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:26:24,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:24,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:24,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:24,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:26:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:26:24,431 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:26:24,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:26:24,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:26:24,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:26:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:26:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:26:24,436 INFO L87 Difference]: Start difference. First operand 639 states and 944 transitions. Second operand 7 states. [2018-11-26 13:26:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:34,956 INFO L93 Difference]: Finished difference Result 1378 states and 2052 transitions. [2018-11-26 13:26:34,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:26:34,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-26 13:26:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:34,960 INFO L225 Difference]: With dead ends: 1378 [2018-11-26 13:26:34,960 INFO L226 Difference]: Without dead ends: 777 [2018-11-26 13:26:34,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:26:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-11-26 13:26:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 607. [2018-11-26 13:26:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-26 13:26:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 902 transitions. [2018-11-26 13:26:35,052 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 902 transitions. Word has length 111 [2018-11-26 13:26:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:35,052 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 902 transitions. [2018-11-26 13:26:35,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:26:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 902 transitions. [2018-11-26 13:26:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-26 13:26:35,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:35,053 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:26:35,054 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:35,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1097792614, now seen corresponding path program 1 times [2018-11-26 13:26:35,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:35,054 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 100 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:35,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:26:35,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:26:35,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:26:35,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:35,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:35,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:26:35,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:35,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:35,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:35,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:35,602 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:26:35,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:26:35,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:35,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:26:35,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:35,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:35,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:35,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:26:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:26:35,669 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:26:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:26:35,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:26:35,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:26:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:26:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:26:35,675 INFO L87 Difference]: Start difference. First operand 607 states and 902 transitions. Second operand 7 states. [2018-11-26 13:26:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:43,455 INFO L93 Difference]: Finished difference Result 1208 states and 1798 transitions. [2018-11-26 13:26:43,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:26:43,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-26 13:26:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:43,459 INFO L225 Difference]: With dead ends: 1208 [2018-11-26 13:26:43,459 INFO L226 Difference]: Without dead ends: 639 [2018-11-26 13:26:43,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:26:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-26 13:26:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 609. [2018-11-26 13:26:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-26 13:26:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 904 transitions. [2018-11-26 13:26:43,550 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 904 transitions. Word has length 111 [2018-11-26 13:26:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:43,551 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 904 transitions. [2018-11-26 13:26:43,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:26:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 904 transitions. [2018-11-26 13:26:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-26 13:26:43,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:43,552 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:26:43,552 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:43,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:43,552 INFO L82 PathProgramCache]: Analyzing trace with hash 269664611, now seen corresponding path program 1 times [2018-11-26 13:26:43,553 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:43,553 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 101 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:43,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:44,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:26:44,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:26:44,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:26:44,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:44,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:44,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:26:44,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:44,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:44,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:44,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:44,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:26:44,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:26:44,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:44,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:26:44,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:44,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:44,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:44,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:26:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:26:44,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:26:44,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:26:44,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:26:44,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:26:44,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:26:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:26:44,232 INFO L87 Difference]: Start difference. First operand 609 states and 904 transitions. Second operand 7 states. [2018-11-26 13:26:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:51,100 INFO L93 Difference]: Finished difference Result 1210 states and 1798 transitions. [2018-11-26 13:26:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:26:51,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-11-26 13:26:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:51,105 INFO L225 Difference]: With dead ends: 1210 [2018-11-26 13:26:51,105 INFO L226 Difference]: Without dead ends: 639 [2018-11-26 13:26:51,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:26:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-26 13:26:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 611. [2018-11-26 13:26:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-11-26 13:26:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 906 transitions. [2018-11-26 13:26:51,188 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 906 transitions. Word has length 112 [2018-11-26 13:26:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:51,188 INFO L480 AbstractCegarLoop]: Abstraction has 611 states and 906 transitions. [2018-11-26 13:26:51,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:26:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 906 transitions. [2018-11-26 13:26:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-26 13:26:51,189 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:51,190 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:26:51,190 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:51,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:51,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1874554773, now seen corresponding path program 1 times [2018-11-26 13:26:51,191 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:51,191 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 102 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:51,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:51,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:26:51,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:26:51,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:26:51,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:51,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:51,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:26:51,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:51,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:51,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:51,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:51,767 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:26:51,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:26:51,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:26:51,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:26:51,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:26:51,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:51,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:26:51,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:26:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-26 13:26:51,834 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:26:51,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:26:51,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:26:51,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:26:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:26:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:26:51,839 INFO L87 Difference]: Start difference. First operand 611 states and 906 transitions. Second operand 7 states. [2018-11-26 13:26:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:26:59,330 INFO L93 Difference]: Finished difference Result 986 states and 1452 transitions. [2018-11-26 13:26:59,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:26:59,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-26 13:26:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:26:59,335 INFO L225 Difference]: With dead ends: 986 [2018-11-26 13:26:59,335 INFO L226 Difference]: Without dead ends: 371 [2018-11-26 13:26:59,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:26:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-26 13:26:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2018-11-26 13:26:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-26 13:26:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 536 transitions. [2018-11-26 13:26:59,391 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 536 transitions. Word has length 113 [2018-11-26 13:26:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:26:59,391 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 536 transitions. [2018-11-26 13:26:59,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:26:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 536 transitions. [2018-11-26 13:26:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-26 13:26:59,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:26:59,392 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:26:59,393 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:26:59,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:26:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash 682577892, now seen corresponding path program 1 times [2018-11-26 13:26:59,393 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:26:59,393 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 103 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:26:59,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:26:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:26:59,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:27:00,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 41 [2018-11-26 13:27:00,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-26 13:27:00,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:00,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 64 [2018-11-26 13:27:00,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 49 [2018-11-26 13:27:00,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:00,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:00,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:27:00,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:00,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:02,303 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_prenex_1 (bvadd (select (select |v_#memory_$Pointer$.offset_197| ssl3_accept_~s.base) (bvadd ssl3_accept_~s.offset (_ bv84 32))) (_ bv844 32))) (_ bv8448 32)) [2018-11-26 13:27:02,304 INFO L303 Elim1Store]: Index analysis took 2109 ms [2018-11-26 13:27:02,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2018-11-26 13:27:02,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:02,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:04,514 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimArr_96 (bvadd (select (select |v_#memory_$Pointer$.offset_197| ssl3_accept_~s.base) (bvadd ssl3_accept_~s.offset (_ bv84 32))) (_ bv844 32))) (select v_arrayElimArr_96 (bvadd ssl3_accept_~s.offset (_ bv52 32)))) [2018-11-26 13:27:06,527 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimArr_96 (bvadd (select (select |v_#memory_$Pointer$.offset_197| ssl3_accept_~s.base) (bvadd ssl3_accept_~s.offset (_ bv84 32))) (_ bv844 32))) (_ bv0 32)) [2018-11-26 13:27:06,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:06,530 INFO L303 Elim1Store]: Index analysis took 4105 ms [2018-11-26 13:27:06,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 89 [2018-11-26 13:27:06,998 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-26 13:27:07,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:07,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:07,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 59 [2018-11-26 13:27:07,085 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,133 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-26 13:27:07,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-26 13:27:07,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-26 13:27:07,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-26 13:27:07,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-26 13:27:07,297 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,307 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-26 13:27:07,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-26 13:27:07,316 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:07,331 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:07,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-11-26 13:27:07,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-26 13:27:07,337 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,346 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-26 13:27:07,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-26 13:27:07,405 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,412 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-11-26 13:27:07,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-26 13:27:07,420 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:07,434 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:07,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-26 13:27:07,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-26 13:27:07,439 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,445 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,475 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 3 variables, input treesize:78, output treesize:22 [2018-11-26 13:27:07,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:27:07,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:07,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:27:07,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:07,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:27:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:27:07,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:27:07,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:27:07,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:27:07,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:27:07,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:27:07,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:27:07,552 INFO L87 Difference]: Start difference. First operand 359 states and 536 transitions. Second operand 7 states. [2018-11-26 13:27:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:27:18,175 INFO L93 Difference]: Finished difference Result 776 states and 1170 transitions. [2018-11-26 13:27:18,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:27:18,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-11-26 13:27:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:27:18,179 INFO L225 Difference]: With dead ends: 776 [2018-11-26 13:27:18,179 INFO L226 Difference]: Without dead ends: 455 [2018-11-26 13:27:18,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:27:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-26 13:27:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 375. [2018-11-26 13:27:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-26 13:27:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 557 transitions. [2018-11-26 13:27:18,242 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 557 transitions. Word has length 115 [2018-11-26 13:27:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:27:18,242 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 557 transitions. [2018-11-26 13:27:18,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:27:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 557 transitions. [2018-11-26 13:27:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-26 13:27:18,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:27:18,243 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:27:18,243 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:27:18,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:27:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash 299610511, now seen corresponding path program 1 times [2018-11-26 13:27:18,244 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:27:18,244 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 104 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:27:18,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:27:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:27:18,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:27:19,107 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-26 13:27:19,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-26 13:27:19,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:27:19,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:27:19,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:27:19,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-26 13:27:19,370 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:27:19,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:27:19,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:27:19,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:19,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-26 13:27:19,673 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,696 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,712 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,728 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:19,776 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-26 13:27:19,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:19,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:20,655 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-11-26 13:27:20,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:20,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:20,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:20,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:20,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:21,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:21,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,590 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:21,612 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:21,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-26 13:27:21,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-26 13:27:21,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 57 [2018-11-26 13:27:21,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-26 13:27:21,846 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,870 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,890 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,903 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:21,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:21,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:21,952 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,960 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:21,975 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:133, output treesize:19 [2018-11-26 13:27:22,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:22,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:22,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:27:22,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:27:22,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:27:22,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:22,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:22,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:27:22,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:27:22,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:27:22,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:27:22,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:27:22,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:22,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:22,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:27:22,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:27:22,674 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,684 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:22,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:22,715 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,721 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,729 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:95, output treesize:19 [2018-11-26 13:27:22,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:27:22,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:27:22,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:22,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:22,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:27:22,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:27:22,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:27:22,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:27:22,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:22,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:27:22,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:27:22,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-26 13:27:22,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-26 13:27:22,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:22,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:23,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 132 [2018-11-26 13:27:23,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:27:23,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:23,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 79 [2018-11-26 13:27:23,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:27:23,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,139 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:148, output treesize:40 [2018-11-26 13:27:23,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-26 13:27:23,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2018-11-26 13:27:23,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-26 13:27:23,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-26 13:27:23,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-26 13:27:23,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:23,211 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:52, output treesize:5 [2018-11-26 13:27:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:27:23,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:27:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:27:23,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:27:23,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:27:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:27:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:27:23,264 INFO L87 Difference]: Start difference. First operand 375 states and 557 transitions. Second operand 7 states. [2018-11-26 13:27:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:27:41,024 INFO L93 Difference]: Finished difference Result 1334 states and 2003 transitions. [2018-11-26 13:27:41,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:27:41,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2018-11-26 13:27:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:27:41,027 INFO L225 Difference]: With dead ends: 1334 [2018-11-26 13:27:41,027 INFO L226 Difference]: Without dead ends: 997 [2018-11-26 13:27:41,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:27:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-26 13:27:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 677. [2018-11-26 13:27:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-11-26 13:27:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1018 transitions. [2018-11-26 13:27:41,138 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1018 transitions. Word has length 116 [2018-11-26 13:27:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:27:41,138 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 1018 transitions. [2018-11-26 13:27:41,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:27:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1018 transitions. [2018-11-26 13:27:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-26 13:27:41,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:27:41,139 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:27:41,139 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:27:41,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:27:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2062938961, now seen corresponding path program 1 times [2018-11-26 13:27:41,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:27:41,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 105 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:27:41,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:27:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:27:41,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:27:41,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:27:41,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:27:41,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:41,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:41,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:27:41,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:41,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:41,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:41,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:41,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:27:41,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:27:41,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:41,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:27:41,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:41,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:41,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:41,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:27:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:27:41,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:27:41,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:27:41,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:27:41,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:27:41,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:27:41,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:27:41,919 INFO L87 Difference]: Start difference. First operand 677 states and 1018 transitions. Second operand 7 states. [2018-11-26 13:27:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:27:52,760 INFO L93 Difference]: Finished difference Result 1503 states and 2275 transitions. [2018-11-26 13:27:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:27:52,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2018-11-26 13:27:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:27:52,764 INFO L225 Difference]: With dead ends: 1503 [2018-11-26 13:27:52,764 INFO L226 Difference]: Without dead ends: 864 [2018-11-26 13:27:52,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:27:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-11-26 13:27:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 677. [2018-11-26 13:27:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-11-26 13:27:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1018 transitions. [2018-11-26 13:27:52,871 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1018 transitions. Word has length 116 [2018-11-26 13:27:52,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:27:52,871 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 1018 transitions. [2018-11-26 13:27:52,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:27:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1018 transitions. [2018-11-26 13:27:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-26 13:27:52,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:27:52,872 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:27:52,873 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:27:52,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:27:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2029082318, now seen corresponding path program 1 times [2018-11-26 13:27:52,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:27:52,874 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 106 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:27:52,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:27:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:27:53,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:27:53,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-11-26 13:27:53,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-11-26 13:27:53,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:53,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:53,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-11-26 13:27:53,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-11-26 13:27:53,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:53,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:27:53,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-26 13:27:53,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:27:53,642 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:53,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-11-26 13:27:53,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2018-11-26 13:27:53,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:53,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:53,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:27:53,757 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:53,778 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:53,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:53,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-11-26 13:27:53,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:53,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:53,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-26 13:27:53,949 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:54,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:54,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:54,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:54,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:54,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:54,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 75 [2018-11-26 13:27:54,149 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-26 13:27:54,214 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-26 13:27:54,262 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-26 13:27:54,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-26 13:27:54,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-26 13:27:54,352 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:78, output treesize:54 [2018-11-26 13:27:54,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:27:54,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:27:54,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:27:54,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:27:54,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:54,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:27:54,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:27:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:27:54,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:27:54,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:27:54,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:27:54,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:27:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:27:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:27:54,455 INFO L87 Difference]: Start difference. First operand 677 states and 1018 transitions. Second operand 7 states. [2018-11-26 13:28:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:28:04,700 INFO L93 Difference]: Finished difference Result 1491 states and 2256 transitions. [2018-11-26 13:28:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:28:04,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2018-11-26 13:28:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:28:04,704 INFO L225 Difference]: With dead ends: 1491 [2018-11-26 13:28:04,704 INFO L226 Difference]: Without dead ends: 852 [2018-11-26 13:28:04,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:28:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-11-26 13:28:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 677. [2018-11-26 13:28:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-11-26 13:28:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1018 transitions. [2018-11-26 13:28:04,816 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1018 transitions. Word has length 116 [2018-11-26 13:28:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:28:04,817 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 1018 transitions. [2018-11-26 13:28:04,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:28:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1018 transitions. [2018-11-26 13:28:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-26 13:28:04,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:28:04,817 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-26 13:28:04,818 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:28:04,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:28:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1477561501, now seen corresponding path program 1 times [2018-11-26 13:28:04,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:28:04,819 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 107 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:28:04,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:28:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:28:05,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:28:05,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-26 13:28:05,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-26 13:28:05,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:05,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:05,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:28:05,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:05,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:05,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:05,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:05,594 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-26 13:28:05,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:28:05,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:05,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:28:05,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:05,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:05,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:05,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:28:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:28:05,669 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:28:05,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:28:05,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-26 13:28:05,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-26 13:28:05,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-26 13:28:05,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-26 13:28:05,674 INFO L87 Difference]: Start difference. First operand 677 states and 1018 transitions. Second operand 7 states. [2018-11-26 13:28:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:28:16,667 INFO L93 Difference]: Finished difference Result 1434 states and 2166 transitions. [2018-11-26 13:28:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-26 13:28:16,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2018-11-26 13:28:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:28:16,671 INFO L225 Difference]: With dead ends: 1434 [2018-11-26 13:28:16,671 INFO L226 Difference]: Without dead ends: 795 [2018-11-26 13:28:16,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-26 13:28:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-11-26 13:28:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 622. [2018-11-26 13:28:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-26 13:28:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 932 transitions. [2018-11-26 13:28:16,775 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 932 transitions. Word has length 117 [2018-11-26 13:28:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:28:16,775 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 932 transitions. [2018-11-26 13:28:16,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-26 13:28:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 932 transitions. [2018-11-26 13:28:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-26 13:28:16,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:28:16,776 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:28:16,776 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:28:16,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:28:16,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1863324990, now seen corresponding path program 1 times [2018-11-26 13:28:16,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:28:16,777 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 108 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:28:16,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:28:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:28:17,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:28:17,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:28:17,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:28:17,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-26 13:28:17,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-26 13:28:17,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:17,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:17,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:28:17,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-26 13:28:17,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:28:17,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:17,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:28:17,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:17,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:28:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:28:17,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:28:17,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:28:17,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:28:17,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:28:17,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:28:17,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:28:17,427 INFO L87 Difference]: Start difference. First operand 622 states and 932 transitions. Second operand 8 states. [2018-11-26 13:28:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:28:26,087 INFO L93 Difference]: Finished difference Result 1377 states and 2074 transitions. [2018-11-26 13:28:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:28:26,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2018-11-26 13:28:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:28:26,091 INFO L225 Difference]: With dead ends: 1377 [2018-11-26 13:28:26,091 INFO L226 Difference]: Without dead ends: 793 [2018-11-26 13:28:26,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:28:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-26 13:28:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 688. [2018-11-26 13:28:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-11-26 13:28:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1036 transitions. [2018-11-26 13:28:26,201 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1036 transitions. Word has length 117 [2018-11-26 13:28:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:28:26,201 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1036 transitions. [2018-11-26 13:28:26,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:28:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1036 transitions. [2018-11-26 13:28:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-26 13:28:26,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:28:26,202 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 13:28:26,202 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:28:26,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:28:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 45132800, now seen corresponding path program 1 times [2018-11-26 13:28:26,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:28:26,203 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 109 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:28:26,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:28:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:28:26,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:28:26,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-26 13:28:26,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:28:26,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-26 13:28:26,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-26 13:28:26,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:26,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:26,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-26 13:28:26,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-26 13:28:26,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-26 13:28:26,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:26,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-26 13:28:26,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:26,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:5 [2018-11-26 13:28:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-26 13:28:26,858 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-26 13:28:26,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-26 13:28:26,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-26 13:28:26,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-26 13:28:26,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-26 13:28:26,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-26 13:28:26,864 INFO L87 Difference]: Start difference. First operand 688 states and 1036 transitions. Second operand 8 states. [2018-11-26 13:28:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:28:37,701 INFO L93 Difference]: Finished difference Result 1507 states and 2280 transitions. [2018-11-26 13:28:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-26 13:28:37,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2018-11-26 13:28:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:28:37,705 INFO L225 Difference]: With dead ends: 1507 [2018-11-26 13:28:37,705 INFO L226 Difference]: Without dead ends: 857 [2018-11-26 13:28:37,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-26 13:28:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-11-26 13:28:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 686. [2018-11-26 13:28:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-11-26 13:28:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1034 transitions. [2018-11-26 13:28:37,820 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1034 transitions. Word has length 117 [2018-11-26 13:28:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:28:37,821 INFO L480 AbstractCegarLoop]: Abstraction has 686 states and 1034 transitions. [2018-11-26 13:28:37,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-26 13:28:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1034 transitions. [2018-11-26 13:28:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-26 13:28:37,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-26 13:28:37,821 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-26 13:28:37,822 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-26 13:28:37,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-26 13:28:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1289710323, now seen corresponding path program 1 times [2018-11-26 13:28:37,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-26 13:28:37,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 110 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-26 13:28:37,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-26 13:28:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-26 13:28:38,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-26 13:28:38,730 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-26 13:28:38,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-26 13:28:38,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:38,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:28:38,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:28:38,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:38,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:28:38,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:38,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:38,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:38,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-26 13:28:38,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:38,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-26 13:28:39,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-26 13:28:39,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:39,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-26 13:28:39,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:39,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:39,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:39,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-26 13:28:39,219 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,245 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,262 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,278 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,322 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-26 13:28:39,508 INFO L303 Elim1Store]: Index analysis took 150 ms [2018-11-26 13:28:39,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:28:39,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:39,627 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-11-26 13:28:39,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:39,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:39,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:40,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:40,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:40,618 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:40,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:40,893 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:40,913 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:41,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-26 13:28:41,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-26 13:28:41,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-26 13:28:41,176 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,225 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,259 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-26 13:28:41,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-26 13:28:41,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 57 [2018-11-26 13:28:41,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-11-26 13:28:41,455 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,468 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,482 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,489 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,509 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:133, output treesize:19 [2018-11-26 13:28:41,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:28:41,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:28:41,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:28:41,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:41,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:28:41,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:28:41,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:28:41,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:28:41,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:41,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:28:41,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:28:41,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:41,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:41,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:41,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:28:42,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:28:42,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:28:42,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:42,256 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,269 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:28:42,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:28:42,307 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,312 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,323 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:95, output treesize:19 [2018-11-26 13:28:42,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:28:42,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:28:42,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:28:42,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:42,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:28:42,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-26 13:28:42,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-26 13:28:42,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-26 13:28:42,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:42,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:19 [2018-11-26 13:28:42,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:42,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-11-26 13:28:42,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-11-26 13:28:42,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-26 13:28:42,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-26 13:28:42,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:11 [2018-11-26 13:28:42,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:42,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:42,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2018-11-26 13:28:42,714 INFO L683 Elim1Store]: detected equality via solver [2018-11-26 13:28:42,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 99 [2018-11-26 13:28:42,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 64 [2018-11-26 13:28:42,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-26 13:28:42,806 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:42,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 64 [2018-11-26 13:28:42,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-26 13:28:42,945 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:43,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 73 [2018-11-26 13:28:43,422 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:43,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2018-11-26 13:28:43,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:43,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 120 [2018-11-26 13:28:43,958 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:43,977 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 59 [2018-11-26 13:28:44,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 89 [2018-11-26 13:28:44,248 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 90 [2018-11-26 13:28:44,347 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,383 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2018-11-26 13:28:44,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 60 [2018-11-26 13:28:44,516 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,563 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,585 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:28:44,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:28:44,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-26 13:28:44,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-26 13:28:44,648 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:44,657 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:44,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-26 13:28:44,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-26 13:28:44,664 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:44,674 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-26 13:28:44,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-26 13:28:44,705 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:139, output treesize:59 [2018-11-26 13:28:44,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-26 13:28:44,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-26 13:28:44,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-26 13:28:44,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-11-26 13:28:44,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2018-11-26 13:28:44,911 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-26 13:28:44,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-26 13:28:44,933 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-26 13:28:44,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:44,952 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:63, output treesize:1 [2018-11-26 13:28:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:28:45,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-26 13:28:45,103 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-26 13:28:45,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-26 13:28:45,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-26 13:28:45,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:1 [2018-11-26 13:28:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-26 13:28:45,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-26 13:28:45,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-11-26 13:28:45,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-26 13:28:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-26 13:28:45,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-26 13:28:45,137 INFO L87 Difference]: Start difference. First operand 686 states and 1034 transitions. Second operand 9 states. [2018-11-26 13:28:48,882 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-11-26 13:28:59,445 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-26 13:29:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-26 13:29:07,175 INFO L93 Difference]: Finished difference Result 1712 states and 2602 transitions. [2018-11-26 13:29:07,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-26 13:29:07,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2018-11-26 13:29:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-26 13:29:07,177 INFO L225 Difference]: With dead ends: 1712 [2018-11-26 13:29:07,177 INFO L226 Difference]: Without dead ends: 0 [2018-11-26 13:29:07,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-11-26 13:29:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-26 13:29:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-26 13:29:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-26 13:29:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-26 13:29:07,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2018-11-26 13:29:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-26 13:29:07,182 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-26 13:29:07,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-26 13:29:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-26 13:29:07,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-26 13:29:07,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-26 13:29:07,535 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 6 [2018-11-26 13:29:07,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-26 13:29:07,738 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 6 [2018-11-26 13:29:07,934 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 17 [2018-11-26 13:29:08,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-26 13:29:08,081 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 6 [2018-11-26 13:29:08,211 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 6 [2018-11-26 13:29:08,370 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 6 [2018-11-26 13:29:08,479 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 6 [2018-11-26 13:29:09,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-26 13:29:09,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-26 13:29:09,155 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 569 DAG size of output: 6 [2018-11-26 13:29:09,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-26 13:29:09,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-26 13:29:09,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-26 13:29:09,794 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 569 DAG size of output: 6 [2018-11-26 13:29:10,233 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 6 [2018-11-26 13:29:10,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-26 13:29:10,897 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-26 13:29:10,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-26 13:29:10,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-26 13:29:10,897 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-26 13:29:10,897 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-26 13:29:10,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-26 13:29:10,897 INFO L448 ceAbstractionStarter]: For program point L1074-1(line 1074) no Hoare annotation was computed. [2018-11-26 13:29:10,897 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 1064 1078) the Hoare annotation is: true [2018-11-26 13:29:10,897 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1064 1078) no Hoare annotation was computed. [2018-11-26 13:29:10,898 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1064 1078) no Hoare annotation was computed. [2018-11-26 13:29:10,898 INFO L444 ceAbstractionStarter]: At program point L1074(line 1074) the Hoare annotation is: (let ((.cse0 (bvadd main_~s~0.offset (_ bv84 32)))) (and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse0) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse0) (_ bv0 32)))) [2018-11-26 13:29:10,898 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1460) no Hoare annotation was computed. [2018-11-26 13:29:10,898 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1296) no Hoare annotation was computed. [2018-11-26 13:29:10,898 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1455) no Hoare annotation was computed. [2018-11-26 13:29:10,898 INFO L448 ceAbstractionStarter]: For program point L1325(lines 1325 1329) no Hoare annotation was computed. [2018-11-26 13:29:10,898 INFO L448 ceAbstractionStarter]: For program point L1259(lines 1259 1263) no Hoare annotation was computed. [2018-11-26 13:29:10,899 INFO L448 ceAbstractionStarter]: For program point L1325-2(lines 1246 1655) no Hoare annotation was computed. [2018-11-26 13:29:10,899 INFO L448 ceAbstractionStarter]: For program point L1226(lines 1226 1664) no Hoare annotation was computed. [2018-11-26 13:29:10,899 INFO L448 ceAbstractionStarter]: For program point L1193(lines 1193 1675) no Hoare annotation was computed. [2018-11-26 13:29:10,899 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1686) no Hoare annotation was computed. [2018-11-26 13:29:10,899 INFO L444 ceAbstractionStarter]: At program point L1656(lines 1246 1657) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,899 INFO L448 ceAbstractionStarter]: For program point L1425(lines 1425 1431) no Hoare annotation was computed. [2018-11-26 13:29:10,899 INFO L448 ceAbstractionStarter]: For program point L1392(lines 1392 1411) no Hoare annotation was computed. [2018-11-26 13:29:10,899 INFO L444 ceAbstractionStarter]: At program point L1227(lines 1223 1665) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,899 INFO L444 ceAbstractionStarter]: At program point L1194(lines 1190 1676) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,900 INFO L444 ceAbstractionStarter]: At program point L1161(lines 1160 1686) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1525(lines 1525 1529) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1393(lines 1393 1397) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1393-2(lines 1392 1409) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1493(lines 1493 1497) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1361(lines 1361 1370) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1361-2(lines 1361 1370) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1229(lines 1229 1663) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1196(lines 1196 1674) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1163(lines 1163 1685) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1130(lines 1130 1134) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L451 ceAbstractionStarter]: At program point L1725(lines 1135 1726) the Hoare annotation is: true [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1722) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1694-1(lines 1694 1722) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1628(lines 1628 1632) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1600) no Hoare annotation was computed. [2018-11-26 13:29:10,900 INFO L448 ceAbstractionStarter]: For program point L1628-2(lines 1628 1632) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1265(lines 1265 1282) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1232(lines 1232 1662) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1199(lines 1199 1673) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1265-2(lines 1246 1655) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1684) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1695(lines 1695 1719) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L444 ceAbstractionStarter]: At program point ssl3_acceptENTRY(lines 1079 1737) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (_ bv84 32))) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (_ bv84 32)))))) [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1369) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L444 ceAbstractionStarter]: At program point L1233(lines 1229 1663) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,901 INFO L444 ceAbstractionStarter]: At program point L1200(lines 1196 1674) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1733) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1696(lines 1696 1705) no Hoare annotation was computed. [2018-11-26 13:29:10,901 INFO L448 ceAbstractionStarter]: For program point L1729-2(lines 1729 1733) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1696-2(lines 1695 1717) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1564(lines 1564 1569) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1498(lines 1498 1509) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1465(lines 1465 1469) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L444 ceAbstractionStarter]: At program point L1399(lines 1382 1417) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1272) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L444 ceAbstractionStarter]: At program point L1433(lines 1424 1455) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1235(lines 1235 1661) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1202(lines 1202 1672) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1169(lines 1169 1683) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L444 ceAbstractionStarter]: At program point L1136-2(lines 1136 1724) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1698(lines 1698 1702) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1434(lines 1434 1454) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L448 ceAbstractionStarter]: For program point L1401(lines 1401 1405) no Hoare annotation was computed. [2018-11-26 13:29:10,902 INFO L444 ceAbstractionStarter]: At program point L1203(lines 1202 1672) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,902 INFO L444 ceAbstractionStarter]: At program point L1170(lines 1163 1685) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1137(line 1137) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1435(lines 1435 1441) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1502(lines 1502 1506) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1238(lines 1238 1660) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1671) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1682) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1139(lines 1139 1693) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1536(lines 1536 1548) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L444 ceAbstractionStarter]: At program point L1239(lines 1235 1661) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,903 INFO L444 ceAbstractionStarter]: At program point L1140(lines 1139 1693) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1273(lines 1273 1278) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1587) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1241(lines 1241 1659) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1670) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1175(lines 1175 1681) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1692) no Hoare annotation was computed. [2018-11-26 13:29:10,903 INFO L448 ceAbstractionStarter]: For program point L1638(lines 1638 1649) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1605(lines 1605 1621) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1638-1(lines 1638 1649) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1539(lines 1539 1547) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1308(lines 1308 1312) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L451 ceAbstractionStarter]: At program point L1242(lines 1241 1659) the Hoare annotation is: true [2018-11-26 13:29:10,904 INFO L444 ceAbstractionStarter]: At program point L1209(lines 1205 1671) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,904 INFO L444 ceAbstractionStarter]: At program point L1176(lines 1172 1682) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1342(lines 1342 1346) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1342-2(lines 1246 1655) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1574(lines 1574 1586) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1475-1(lines 1475 1487) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1669) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1680) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1691) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1707(lines 1707 1713) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point $Ultimate##87(lines 1246 1657) no Hoare annotation was computed. [2018-11-26 13:29:10,904 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1620) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1542(lines 1542 1546) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1542-1(lines 1246 1655) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L444 ceAbstractionStarter]: At program point L1443(lines 1434 1454) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point $Ultimate##88(lines 1246 1657) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1377(lines 1377 1381) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1377-2(lines 1377 1381) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L451 ceAbstractionStarter]: At program point L1245(lines 1244 1658) the Hoare annotation is: true [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1642(lines 1642 1646) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptEXIT(lines 1079 1737) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1577(lines 1577 1585) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1483) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1214(lines 1214 1668) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1679) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1148(lines 1148 1690) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1119) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1115-2(lines 1115 1119) no Hoare annotation was computed. [2018-11-26 13:29:10,905 INFO L448 ceAbstractionStarter]: For program point L1611(lines 1611 1619) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L444 ceAbstractionStarter]: At program point L1545(lines 1104 1736) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1446(lines 1446 1450) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L444 ceAbstractionStarter]: At program point L1215(lines 1211 1669) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,906 INFO L444 ceAbstractionStarter]: At program point L1182(lines 1178 1680) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptFINAL(lines 1079 1737) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L444 ceAbstractionStarter]: At program point L1249(lines 1142 1692) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1735) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1580(lines 1580 1584) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1514(lines 1514 1518) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1580-2(lines 1246 1655) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1417) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1217(lines 1217 1667) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1678) no Hoare annotation was computed. [2018-11-26 13:29:10,906 INFO L448 ceAbstractionStarter]: For program point L1151(lines 1151 1689) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1614(lines 1614 1618) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1614-2(lines 1246 1655) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1416) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1352(lines 1352 1356) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1352-2(lines 1352 1356) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1666) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1187(lines 1187 1677) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1154(lines 1154 1688) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1121(lines 1121 1129) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1121-1(lines 1121 1129) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1258) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L444 ceAbstractionStarter]: At program point L1221(lines 1217 1667) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,907 INFO L444 ceAbstractionStarter]: At program point L1188(lines 1184 1678) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1254-2(lines 1254 1258) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1126) no Hoare annotation was computed. [2018-11-26 13:29:10,907 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1415) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1388-1(lines 1388 1415) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1223(lines 1223 1665) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1676) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1157(lines 1157 1687) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1558) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1554-2(lines 1554 1558) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1412) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1302) no Hoare annotation was computed. [2018-11-26 13:29:10,908 INFO L444 ceAbstractionStarter]: At program point L1158(lines 1154 1688) the Hoare annotation is: (or (not (= (_ bv0 32) |ssl3_accept_#in~s.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |ssl3_accept_#in~s.base|) (_ bv84 32)) |ssl3_accept_#in~s.base|) (= ssl3_accept_~s.offset (_ bv0 32)) (not (= (select (select |old(#memory_$Pointer$.offset)| |ssl3_accept_#in~s.base|) (_ bv84 32)) (_ bv0 32)))) [2018-11-26 13:29:10,917 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,918 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,921 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,921 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,925 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,925 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,925 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,925 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,927 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,927 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,927 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,927 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,928 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,928 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,928 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,929 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,929 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,929 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,930 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,930 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,931 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,931 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,931 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,932 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,932 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,932 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,933 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,933 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,933 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,933 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,934 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,934 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,934 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,935 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,935 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,936 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,936 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,936 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,937 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,937 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,937 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,937 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,938 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,938 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,939 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,939 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,939 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,940 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,940 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,940 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,941 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,941 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,941 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,941 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,942 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,942 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,942 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,942 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,943 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,943 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,943 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,944 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,944 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,944 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,944 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,945 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,946 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,946 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,946 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,946 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,947 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,947 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,947 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,948 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,948 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,948 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,949 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,949 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,949 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,949 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,950 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,950 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,950 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,951 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,951 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,951 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,951 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,952 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,952 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,952 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,953 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,953 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,953 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,953 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,954 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,954 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,954 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,954 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,955 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,956 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,956 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,957 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,958 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,958 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,959 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,959 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,960 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,960 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,961 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,961 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,961 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,962 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,962 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,962 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,963 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,964 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,964 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,965 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,965 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,965 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,965 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,966 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,966 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,966 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,966 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,967 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,967 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,968 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,968 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,969 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,969 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,970 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,970 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,971 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,971 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,971 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,972 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,972 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,973 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,974 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,974 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,975 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,975 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,975 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,976 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,976 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:10,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:10,977 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,977 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:10,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:29:10 BoogieIcfgContainer [2018-11-26 13:29:10,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-26 13:29:10,980 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-26 13:29:10,980 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-26 13:29:10,980 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-26 13:29:10,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:15:46" (3/4) ... [2018-11-26 13:29:10,987 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-26 13:29:10,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-26 13:29:10,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-26 13:29:10,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_accept [2018-11-26 13:29:11,016 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-26 13:29:11,018 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-26 13:29:11,020 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-26 13:29:11,021 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-26 13:29:11,023 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-26 13:29:11,063 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,064 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,064 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,065 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,066 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,066 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,066 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) [2018-11-26 13:29:11,206 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-26 13:29:11,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-26 13:29:11,208 INFO L168 Benchmark]: Toolchain (without parser) took 809521.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 943.2 MB in the beginning and 954.4 MB in the end (delta: -11.2 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. [2018-11-26 13:29:11,208 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-26 13:29:11,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-11-26 13:29:11,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.71 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-26 13:29:11,209 INFO L168 Benchmark]: Boogie Preprocessor took 97.98 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-26 13:29:11,209 INFO L168 Benchmark]: RCFGBuilder took 3592.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. [2018-11-26 13:29:11,210 INFO L168 Benchmark]: TraceAbstraction took 804831.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -8.9 MB). Free memory was 1.0 GB in the beginning and 975.2 MB in the end (delta: 31.9 MB). Peak memory consumption was 230.3 MB. Max. memory is 11.5 GB. [2018-11-26 13:29:11,210 INFO L168 Benchmark]: Witness Printer took 226.33 ms. Allocated memory is still 1.2 GB. Free memory was 975.2 MB in the beginning and 954.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-26 13:29:11,213 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 718.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.71 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.98 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3592.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 87.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 804831.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -8.9 MB). Free memory was 1.0 GB in the beginning and 975.2 MB in the end (delta: 31.9 MB). Peak memory consumption was 230.3 MB. Max. memory is 11.5 GB. * Witness Printer took 226.33 ms. Allocated memory is still 1.2 GB. Free memory was 975.2 MB in the beginning and 954.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1735]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1211]: Loop Invariant [2018-11-26 13:29:11,281 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,282 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,282 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,282 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,283 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,283 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,283 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,283 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1139]: Loop Invariant [2018-11-26 13:29:11,283 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,284 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,284 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,327 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,328 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,328 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1178]: Loop Invariant [2018-11-26 13:29:11,329 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,329 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,329 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,329 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,329 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,330 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,330 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1229]: Loop Invariant [2018-11-26 13:29:11,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,331 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,331 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,332 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,332 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1154]: Loop Invariant [2018-11-26 13:29:11,332 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,373 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,374 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,374 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,374 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1196]: Loop Invariant [2018-11-26 13:29:11,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,375 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,375 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,377 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,377 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1241]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1205]: Loop Invariant [2018-11-26 13:29:11,377 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,377 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,378 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,378 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,378 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,378 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,378 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,419 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1136]: Loop Invariant [2018-11-26 13:29:11,420 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,420 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,421 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,421 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1434]: Loop Invariant [2018-11-26 13:29:11,422 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,423 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,423 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,424 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,424 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1172]: Loop Invariant [2018-11-26 13:29:11,424 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,424 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,424 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,425 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,428 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,462 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,462 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1382]: Loop Invariant [2018-11-26 13:29:11,462 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,463 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,463 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,463 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,463 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,464 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1142]: Loop Invariant [2018-11-26 13:29:11,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,464 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,465 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,470 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,470 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,470 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,470 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1223]: Loop Invariant [2018-11-26 13:29:11,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,505 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,505 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,505 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,506 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,506 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,506 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1190]: Loop Invariant [2018-11-26 13:29:11,506 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,506 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,507 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,507 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,507 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,507 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1160]: Loop Invariant [2018-11-26 13:29:11,508 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,509 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,509 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,509 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,509 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1104]: Loop Invariant [2018-11-26 13:29:11,545 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,545 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,545 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,545 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,546 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,546 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,546 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,546 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1202]: Loop Invariant [2018-11-26 13:29:11,546 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,547 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,547 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,547 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,547 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,547 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,547 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,548 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1163]: Loop Invariant [2018-11-26 13:29:11,548 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,548 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,548 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,548 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,549 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,549 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,580 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,580 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1217]: Loop Invariant [2018-11-26 13:29:11,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,581 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,581 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,581 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,582 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,582 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1184]: Loop Invariant [2018-11-26 13:29:11,582 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,582 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,582 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,582 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,584 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,584 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,584 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,584 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1424]: Loop Invariant [2018-11-26 13:29:11,584 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,585 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,585 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,585 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,608 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,609 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,609 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1246]: Loop Invariant [2018-11-26 13:29:11,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,609 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,609 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,610 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,610 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - InvariantResult [Line: 1235]: Loop Invariant [2018-11-26 13:29:11,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,614 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,614 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,615 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-26 13:29:11,615 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-26 13:29:11,615 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-26 13:29:11,615 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((!(0bv32 == s) || \old(#memory_$Pointer$)[s][84bv32] == s) || s == 0bv32) || !(\old(#memory_$Pointer$)[s][84bv32] == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 162 locations, 1 error locations. SAFE Result, 804.6s OverallTime, 109 OverallIterations, 4 TraceHistogramMax, 717.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 20759 SDtfs, 38034 SDslu, 47460 SDs, 0 SdLazy, 41931 SolverSat, 2896 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 663.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10414 GetRequests, 9746 SyntacticMatches, 0 SemanticMatches, 668 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=893occurred in iteration=94, 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: 6.1s AutomataMinimizationTime, 109 MinimizatonAttempts, 10101 StatesRemovedByMinimization, 108 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 32 PreInvPairs, 187 NumberOfFragments, 595 HoareAnnotationTreeSize, 32 FomulaSimplifications, 111993446567508598 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 32 FomulaSimplificationsInter, 112 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 2.8s SsaConstructionTime, 34.9s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 9567 NumberOfCodeBlocks, 9567 NumberOfCodeBlocksAsserted, 109 NumberOfCheckSat, 10138 ConstructedInterpolants, 33 QuantifiedInterpolants, 5235904 SizeOfPredicates, 508 NumberOfNonLiveVariables, 32575 ConjunctsInSsa, 717 ConjunctsInUnsatCore, 117 InterpolantComputations, 109 PerfectInterpolantSequences, 4296/4354 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...