./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a7396ffb12cf754f13107d729c5350f83c5ce55 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a7396ffb12cf754f13107d729c5350f83c5ce55 ....................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 18:00:54,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 18:00:54,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 18:00:54,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 18:00:54,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 18:00:54,531 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 18:00:54,532 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 18:00:54,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 18:00:54,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 18:00:54,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 18:00:54,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 18:00:54,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 18:00:54,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 18:00:54,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 18:00:54,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 18:00:54,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 18:00:54,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 18:00:54,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 18:00:54,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 18:00:54,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 18:00:54,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 18:00:54,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 18:00:54,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 18:00:54,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 18:00:54,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 18:00:54,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 18:00:54,542 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 18:00:54,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 18:00:54,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 18:00:54,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 18:00:54,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 18:00:54,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 18:00:54,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 18:00:54,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 18:00:54,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 18:00:54,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 18:00:54,545 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 18:00:54,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 18:00:54,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 18:00:54,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 18:00:54,553 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 18:00:54,553 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 18:00:54,553 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 18:00:54,553 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 18:00:54,553 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 18:00:54,553 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 18:00:54,553 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 18:00:54,553 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 18:00:54,554 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 18:00:54,554 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 18:00:54,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 18:00:54,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 18:00:54,554 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 18:00:54,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 18:00:54,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 18:00:54,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 18:00:54,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 18:00:54,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:00:54,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 18:00:54,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 18:00:54,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 18:00:54,556 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 18:00:54,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 18:00:54,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 18:00:54,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 18:00:54,556 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan 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 -> Taipan 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 -> 0a7396ffb12cf754f13107d729c5350f83c5ce55 [2018-12-08 18:00:54,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 18:00:54,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 18:00:54,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 18:00:54,586 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 18:00:54,586 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 18:00:54,587 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-08 18:00:54,634 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/7248f56d7/ca821a6666454995bdc861fdb31b6853/FLAG577be37bb [2018-12-08 18:00:55,004 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 18:00:55,004 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-08 18:00:55,013 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/7248f56d7/ca821a6666454995bdc861fdb31b6853/FLAG577be37bb [2018-12-08 18:00:55,373 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/7248f56d7/ca821a6666454995bdc861fdb31b6853 [2018-12-08 18:00:55,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 18:00:55,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 18:00:55,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 18:00:55,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 18:00:55,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 18:00:55,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73600ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55, skipping insertion in model container [2018-12-08 18:00:55,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 18:00:55,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 18:00:55,653 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:00:55,662 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 18:00:55,717 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:00:55,728 INFO L195 MainTranslator]: Completed translation [2018-12-08 18:00:55,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55 WrapperNode [2018-12-08 18:00:55,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 18:00:55,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 18:00:55,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 18:00:55,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 18:00:55,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 18:00:55,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 18:00:55,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 18:00:55,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 18:00:55,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... [2018-12-08 18:00:55,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 18:00:55,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 18:00:55,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 18:00:55,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 18:00:55,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:00:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 18:00:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 18:00:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-08 18:00:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 18:00:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 18:00:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 18:00:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 18:00:56,017 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 18:00:56,017 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 18:00:56,391 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 18:00:56,391 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 18:00:56,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:00:56 BoogieIcfgContainer [2018-12-08 18:00:56,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 18:00:56,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 18:00:56,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 18:00:56,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 18:00:56,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 06:00:55" (1/3) ... [2018-12-08 18:00:56,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caba6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:00:56, skipping insertion in model container [2018-12-08 18:00:56,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:00:55" (2/3) ... [2018-12-08 18:00:56,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7caba6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:00:56, skipping insertion in model container [2018-12-08 18:00:56,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:00:56" (3/3) ... [2018-12-08 18:00:56,396 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-08 18:00:56,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 18:00:56,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 18:00:56,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 18:00:56,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 18:00:56,436 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 18:00:56,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 18:00:56,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 18:00:56,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 18:00:56,437 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 18:00:56,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 18:00:56,437 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 18:00:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-12-08 18:00:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 18:00:56,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:56,455 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-12-08 18:00:56,456 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:56,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2113124833, now seen corresponding path program 1 times [2018-12-08 18:00:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:56,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:56,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:56,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:56,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:56,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:56,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:56,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:56,660 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 4 states. [2018-12-08 18:00:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:56,907 INFO L93 Difference]: Finished difference Result 349 states and 590 transitions. [2018-12-08 18:00:56,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:56,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-08 18:00:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:56,916 INFO L225 Difference]: With dead ends: 349 [2018-12-08 18:00:56,916 INFO L226 Difference]: Without dead ends: 177 [2018-12-08 18:00:56,920 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-12-08 18:00:56,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-08 18:00:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2018-12-08 18:00:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-08 18:00:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2018-12-08 18:00:56,951 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 49 [2018-12-08 18:00:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:56,952 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2018-12-08 18:00:56,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2018-12-08 18:00:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 18:00:56,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:56,953 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-12-08 18:00:56,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:56,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1676763913, now seen corresponding path program 1 times [2018-12-08 18:00:56,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:56,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:56,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:56,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:56,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:57,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:57,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:57,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:57,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:57,043 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand 4 states. [2018-12-08 18:00:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:57,242 INFO L93 Difference]: Finished difference Result 312 states and 481 transitions. [2018-12-08 18:00:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:57,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-08 18:00:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:57,243 INFO L225 Difference]: With dead ends: 312 [2018-12-08 18:00:57,243 INFO L226 Difference]: Without dead ends: 177 [2018-12-08 18:00:57,244 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-12-08 18:00:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-08 18:00:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2018-12-08 18:00:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-08 18:00:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2018-12-08 18:00:57,250 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 62 [2018-12-08 18:00:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:57,251 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2018-12-08 18:00:57,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2018-12-08 18:00:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 18:00:57,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:57,252 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-12-08 18:00:57,252 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:57,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash -779258403, now seen corresponding path program 1 times [2018-12-08 18:00:57,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:57,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:57,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:57,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:57,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:57,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:57,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:00:57,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:57,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:00:57,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:00:57,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:00:57,345 INFO L87 Difference]: Start difference. First operand 160 states and 247 transitions. Second operand 5 states. [2018-12-08 18:00:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:57,642 INFO L93 Difference]: Finished difference Result 316 states and 489 transitions. [2018-12-08 18:00:57,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:00:57,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-08 18:00:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:57,643 INFO L225 Difference]: With dead ends: 316 [2018-12-08 18:00:57,643 INFO L226 Difference]: Without dead ends: 181 [2018-12-08 18:00:57,643 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-12-08 18:00:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-08 18:00:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-12-08 18:00:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-08 18:00:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2018-12-08 18:00:57,649 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 63 [2018-12-08 18:00:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:57,649 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2018-12-08 18:00:57,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:00:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2018-12-08 18:00:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 18:00:57,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:57,651 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-12-08 18:00:57,651 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:57,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash 335748436, now seen corresponding path program 1 times [2018-12-08 18:00:57,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:57,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:57,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:57,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:57,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:57,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:57,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:57,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:57,689 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand 4 states. [2018-12-08 18:00:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:57,835 INFO L93 Difference]: Finished difference Result 349 states and 529 transitions. [2018-12-08 18:00:57,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:57,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 18:00:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:57,836 INFO L225 Difference]: With dead ends: 349 [2018-12-08 18:00:57,836 INFO L226 Difference]: Without dead ends: 194 [2018-12-08 18:00:57,836 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-12-08 18:00:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-08 18:00:57,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2018-12-08 18:00:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-08 18:00:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2018-12-08 18:00:57,842 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 63 [2018-12-08 18:00:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:57,842 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2018-12-08 18:00:57,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2018-12-08 18:00:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 18:00:57,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:57,843 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-12-08 18:00:57,843 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:57,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 403308437, now seen corresponding path program 1 times [2018-12-08 18:00:57,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:57,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:57,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:57,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:57,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:57,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:57,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:57,885 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand 4 states. [2018-12-08 18:00:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:58,027 INFO L93 Difference]: Finished difference Result 348 states and 527 transitions. [2018-12-08 18:00:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:58,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 18:00:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:58,028 INFO L225 Difference]: With dead ends: 348 [2018-12-08 18:00:58,028 INFO L226 Difference]: Without dead ends: 193 [2018-12-08 18:00:58,029 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-12-08 18:00:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-08 18:00:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2018-12-08 18:00:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-08 18:00:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 271 transitions. [2018-12-08 18:00:58,036 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 271 transitions. Word has length 63 [2018-12-08 18:00:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:58,036 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 271 transitions. [2018-12-08 18:00:58,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 271 transitions. [2018-12-08 18:00:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 18:00:58,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:58,037 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-12-08 18:00:58,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:58,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1696423930, now seen corresponding path program 1 times [2018-12-08 18:00:58,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:58,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:58,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:58,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:58,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:58,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:58,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:58,090 INFO L87 Difference]: Start difference. First operand 180 states and 271 transitions. Second operand 4 states. [2018-12-08 18:00:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:58,227 INFO L93 Difference]: Finished difference Result 348 states and 526 transitions. [2018-12-08 18:00:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:58,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 18:00:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:58,228 INFO L225 Difference]: With dead ends: 348 [2018-12-08 18:00:58,228 INFO L226 Difference]: Without dead ends: 193 [2018-12-08 18:00:58,228 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-12-08 18:00:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-08 18:00:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2018-12-08 18:00:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-08 18:00:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 270 transitions. [2018-12-08 18:00:58,234 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 270 transitions. Word has length 64 [2018-12-08 18:00:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:58,235 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 270 transitions. [2018-12-08 18:00:58,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 270 transitions. [2018-12-08 18:00:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 18:00:58,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:58,235 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-12-08 18:00:58,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:58,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -822831919, now seen corresponding path program 1 times [2018-12-08 18:00:58,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:58,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:58,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:58,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:58,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:58,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:58,281 INFO L87 Difference]: Start difference. First operand 180 states and 270 transitions. Second operand 4 states. [2018-12-08 18:00:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:58,423 INFO L93 Difference]: Finished difference Result 348 states and 525 transitions. [2018-12-08 18:00:58,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:58,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-08 18:00:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:58,424 INFO L225 Difference]: With dead ends: 348 [2018-12-08 18:00:58,424 INFO L226 Difference]: Without dead ends: 193 [2018-12-08 18:00:58,425 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-12-08 18:00:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-08 18:00:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2018-12-08 18:00:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-08 18:00:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 269 transitions. [2018-12-08 18:00:58,428 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 269 transitions. Word has length 65 [2018-12-08 18:00:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:58,428 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 269 transitions. [2018-12-08 18:00:58,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 269 transitions. [2018-12-08 18:00:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 18:00:58,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:58,429 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-12-08 18:00:58,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:58,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 823556384, now seen corresponding path program 1 times [2018-12-08 18:00:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:58,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:58,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:58,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:58,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:58,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:58,468 INFO L87 Difference]: Start difference. First operand 180 states and 269 transitions. Second operand 4 states. [2018-12-08 18:00:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:58,610 INFO L93 Difference]: Finished difference Result 377 states and 571 transitions. [2018-12-08 18:00:58,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:58,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 18:00:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:58,611 INFO L225 Difference]: With dead ends: 377 [2018-12-08 18:00:58,611 INFO L226 Difference]: Without dead ends: 222 [2018-12-08 18:00:58,612 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-12-08 18:00:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-08 18:00:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2018-12-08 18:00:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:00:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 306 transitions. [2018-12-08 18:00:58,616 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 306 transitions. Word has length 66 [2018-12-08 18:00:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:58,617 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 306 transitions. [2018-12-08 18:00:58,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 306 transitions. [2018-12-08 18:00:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 18:00:58,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:58,617 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-12-08 18:00:58,617 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:58,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:58,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1041654465, now seen corresponding path program 1 times [2018-12-08 18:00:58,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:58,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:58,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:58,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:58,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:58,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:58,660 INFO L87 Difference]: Start difference. First operand 202 states and 306 transitions. Second operand 4 states. [2018-12-08 18:00:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:58,795 INFO L93 Difference]: Finished difference Result 392 states and 598 transitions. [2018-12-08 18:00:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:58,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 18:00:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:58,796 INFO L225 Difference]: With dead ends: 392 [2018-12-08 18:00:58,796 INFO L226 Difference]: Without dead ends: 215 [2018-12-08 18:00:58,796 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-12-08 18:00:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-08 18:00:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2018-12-08 18:00:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:00:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 305 transitions. [2018-12-08 18:00:58,801 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 305 transitions. Word has length 66 [2018-12-08 18:00:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:58,802 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 305 transitions. [2018-12-08 18:00:58,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 305 transitions. [2018-12-08 18:00:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 18:00:58,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:58,802 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-12-08 18:00:58,802 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:58,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash -735871956, now seen corresponding path program 1 times [2018-12-08 18:00:58,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:58,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:58,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:58,840 INFO L87 Difference]: Start difference. First operand 202 states and 305 transitions. Second operand 4 states. [2018-12-08 18:00:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:58,969 INFO L93 Difference]: Finished difference Result 382 states and 585 transitions. [2018-12-08 18:00:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:58,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 18:00:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:58,970 INFO L225 Difference]: With dead ends: 382 [2018-12-08 18:00:58,970 INFO L226 Difference]: Without dead ends: 205 [2018-12-08 18:00:58,970 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-12-08 18:00:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-08 18:00:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-12-08 18:00:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:00:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2018-12-08 18:00:58,975 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 67 [2018-12-08 18:00:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:58,975 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2018-12-08 18:00:58,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2018-12-08 18:00:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 18:00:58,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:58,976 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-12-08 18:00:58,976 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:58,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1729208874, now seen corresponding path program 1 times [2018-12-08 18:00:58,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:58,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:59,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:59,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:59,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:59,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:59,006 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand 4 states. [2018-12-08 18:00:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:59,177 INFO L93 Difference]: Finished difference Result 399 states and 605 transitions. [2018-12-08 18:00:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:59,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 18:00:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:59,178 INFO L225 Difference]: With dead ends: 399 [2018-12-08 18:00:59,178 INFO L226 Difference]: Without dead ends: 222 [2018-12-08 18:00:59,179 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-12-08 18:00:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-08 18:00:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2018-12-08 18:00:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:00:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2018-12-08 18:00:59,183 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 79 [2018-12-08 18:00:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:59,183 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2018-12-08 18:00:59,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2018-12-08 18:00:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 18:00:59,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:59,184 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-12-08 18:00:59,184 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:59,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1961542227, now seen corresponding path program 1 times [2018-12-08 18:00:59,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:59,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:59,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:59,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:59,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:59,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:59,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:59,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:59,213 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand 4 states. [2018-12-08 18:00:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:59,389 INFO L93 Difference]: Finished difference Result 397 states and 601 transitions. [2018-12-08 18:00:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:59,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 18:00:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:59,390 INFO L225 Difference]: With dead ends: 397 [2018-12-08 18:00:59,391 INFO L226 Difference]: Without dead ends: 220 [2018-12-08 18:00:59,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-12-08 18:00:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-08 18:00:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 202. [2018-12-08 18:00:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:00:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2018-12-08 18:00:59,397 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 80 [2018-12-08 18:00:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:59,398 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2018-12-08 18:00:59,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2018-12-08 18:00:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 18:00:59,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:59,399 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-12-08 18:00:59,399 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:59,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2029102228, now seen corresponding path program 1 times [2018-12-08 18:00:59,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:59,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:59,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:59,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:59,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:59,440 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand 4 states. [2018-12-08 18:00:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:59,627 INFO L93 Difference]: Finished difference Result 396 states and 598 transitions. [2018-12-08 18:00:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:59,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 18:00:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:59,628 INFO L225 Difference]: With dead ends: 396 [2018-12-08 18:00:59,628 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 18:00:59,629 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-12-08 18:00:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 18:00:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-08 18:00:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:00:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2018-12-08 18:00:59,635 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 80 [2018-12-08 18:00:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:59,635 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2018-12-08 18:00:59,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2018-12-08 18:00:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 18:00:59,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:59,636 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-12-08 18:00:59,636 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:59,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1458543335, now seen corresponding path program 1 times [2018-12-08 18:00:59,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:59,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:59,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:59,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:59,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:59,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:59,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:59,696 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand 4 states. [2018-12-08 18:00:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:00:59,878 INFO L93 Difference]: Finished difference Result 396 states and 596 transitions. [2018-12-08 18:00:59,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:00:59,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 18:00:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:00:59,879 INFO L225 Difference]: With dead ends: 396 [2018-12-08 18:00:59,879 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 18:00:59,879 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-12-08 18:00:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 18:00:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-08 18:00:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:00:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 300 transitions. [2018-12-08 18:00:59,884 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 300 transitions. Word has length 81 [2018-12-08 18:00:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:00:59,884 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 300 transitions. [2018-12-08 18:00:59,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:00:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 300 transitions. [2018-12-08 18:00:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 18:00:59,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:00:59,885 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-12-08 18:00:59,885 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:00:59,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:00:59,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1803094512, now seen corresponding path program 1 times [2018-12-08 18:00:59,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:00:59,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:00:59,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:00:59,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:00:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:00:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:00:59,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:00:59,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:00:59,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:00:59,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:00:59,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:00:59,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:00:59,936 INFO L87 Difference]: Start difference. First operand 202 states and 300 transitions. Second operand 4 states. [2018-12-08 18:01:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:00,082 INFO L93 Difference]: Finished difference Result 396 states and 594 transitions. [2018-12-08 18:01:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:00,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-08 18:01:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:00,083 INFO L225 Difference]: With dead ends: 396 [2018-12-08 18:01:00,083 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 18:01:00,084 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-12-08 18:01:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 18:01:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-08 18:01:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:01:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2018-12-08 18:01:00,090 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 82 [2018-12-08 18:01:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:00,090 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2018-12-08 18:01:00,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2018-12-08 18:01:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 18:01:00,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:00,091 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-12-08 18:01:00,091 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:00,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash 718285154, now seen corresponding path program 1 times [2018-12-08 18:01:00,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:01:00,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:00,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:00,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:00,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:00,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:00,133 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand 4 states. [2018-12-08 18:01:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:00,298 INFO L93 Difference]: Finished difference Result 396 states and 592 transitions. [2018-12-08 18:01:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:00,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-08 18:01:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:00,299 INFO L225 Difference]: With dead ends: 396 [2018-12-08 18:01:00,299 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 18:01:00,300 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-12-08 18:01:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 18:01:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2018-12-08 18:01:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:01:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 298 transitions. [2018-12-08 18:01:00,306 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 298 transitions. Word has length 83 [2018-12-08 18:01:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:00,306 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 298 transitions. [2018-12-08 18:01:00,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 298 transitions. [2018-12-08 18:01:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 18:01:00,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:00,307 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-12-08 18:01:00,307 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:00,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:00,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2124581291, now seen corresponding path program 1 times [2018-12-08 18:01:00,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:00,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:00,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:01:00,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:00,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:00,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:00,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:00,356 INFO L87 Difference]: Start difference. First operand 202 states and 298 transitions. Second operand 4 states. [2018-12-08 18:01:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:00,495 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2018-12-08 18:01:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:00,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-08 18:01:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:00,496 INFO L225 Difference]: With dead ends: 386 [2018-12-08 18:01:00,496 INFO L226 Difference]: Without dead ends: 209 [2018-12-08 18:01:00,497 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-12-08 18:01:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-08 18:01:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2018-12-08 18:01:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-08 18:01:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 297 transitions. [2018-12-08 18:01:00,501 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 297 transitions. Word has length 84 [2018-12-08 18:01:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:00,502 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 297 transitions. [2018-12-08 18:01:00,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 297 transitions. [2018-12-08 18:01:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 18:01:00,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:00,502 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-12-08 18:01:00,503 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:00,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2086927363, now seen corresponding path program 1 times [2018-12-08 18:01:00,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:00,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:00,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:00,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:00,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:00,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:00,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:00,554 INFO L87 Difference]: Start difference. First operand 202 states and 297 transitions. Second operand 4 states. [2018-12-08 18:01:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:00,798 INFO L93 Difference]: Finished difference Result 491 states and 740 transitions. [2018-12-08 18:01:00,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:00,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-08 18:01:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:00,799 INFO L225 Difference]: With dead ends: 491 [2018-12-08 18:01:00,799 INFO L226 Difference]: Without dead ends: 314 [2018-12-08 18:01:00,800 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-12-08 18:01:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-08 18:01:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 243. [2018-12-08 18:01:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-08 18:01:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 370 transitions. [2018-12-08 18:01:00,807 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 370 transitions. Word has length 88 [2018-12-08 18:01:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:00,807 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 370 transitions. [2018-12-08 18:01:00,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 370 transitions. [2018-12-08 18:01:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 18:01:00,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:00,808 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-12-08 18:01:00,809 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:00,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1784393211, now seen corresponding path program 1 times [2018-12-08 18:01:00,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:00,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:00,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:00,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:00,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:00,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:00,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:00,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:00,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:00,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:00,862 INFO L87 Difference]: Start difference. First operand 243 states and 370 transitions. Second operand 4 states. [2018-12-08 18:01:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:01,035 INFO L93 Difference]: Finished difference Result 510 states and 786 transitions. [2018-12-08 18:01:01,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:01,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-08 18:01:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:01,036 INFO L225 Difference]: With dead ends: 510 [2018-12-08 18:01:01,036 INFO L226 Difference]: Without dead ends: 292 [2018-12-08 18:01:01,037 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-12-08 18:01:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-08 18:01:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 267. [2018-12-08 18:01:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-08 18:01:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2018-12-08 18:01:01,042 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 88 [2018-12-08 18:01:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:01,042 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2018-12-08 18:01:01,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2018-12-08 18:01:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-08 18:01:01,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:01,043 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-12-08 18:01:01,043 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:01,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1411818959, now seen corresponding path program 1 times [2018-12-08 18:01:01,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:01,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:01,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:01,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:01,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:01,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:01,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:01,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:01,079 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand 4 states. [2018-12-08 18:01:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:01,301 INFO L93 Difference]: Finished difference Result 572 states and 883 transitions. [2018-12-08 18:01:01,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:01,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-08 18:01:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:01,302 INFO L225 Difference]: With dead ends: 572 [2018-12-08 18:01:01,302 INFO L226 Difference]: Without dead ends: 330 [2018-12-08 18:01:01,303 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-12-08 18:01:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-08 18:01:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2018-12-08 18:01:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 412 transitions. [2018-12-08 18:01:01,308 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 412 transitions. Word has length 89 [2018-12-08 18:01:01,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:01,308 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 412 transitions. [2018-12-08 18:01:01,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 412 transitions. [2018-12-08 18:01:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 18:01:01,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:01,309 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-12-08 18:01:01,309 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:01,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1997461465, now seen corresponding path program 1 times [2018-12-08 18:01:01,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:01,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:01,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:01,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:01,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:01,353 INFO L87 Difference]: Start difference. First operand 268 states and 412 transitions. Second operand 4 states. [2018-12-08 18:01:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:01,593 INFO L93 Difference]: Finished difference Result 573 states and 883 transitions. [2018-12-08 18:01:01,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:01,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 18:01:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:01,594 INFO L225 Difference]: With dead ends: 573 [2018-12-08 18:01:01,594 INFO L226 Difference]: Without dead ends: 330 [2018-12-08 18:01:01,595 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-12-08 18:01:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-08 18:01:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2018-12-08 18:01:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 411 transitions. [2018-12-08 18:01:01,600 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 411 transitions. Word has length 101 [2018-12-08 18:01:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:01,600 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 411 transitions. [2018-12-08 18:01:01,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 411 transitions. [2018-12-08 18:01:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 18:01:01,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:01,601 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-12-08 18:01:01,601 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:01,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1121442459, now seen corresponding path program 1 times [2018-12-08 18:01:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:01,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:01,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:01,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:01,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:01,653 INFO L87 Difference]: Start difference. First operand 268 states and 411 transitions. Second operand 4 states. [2018-12-08 18:01:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:01,822 INFO L93 Difference]: Finished difference Result 536 states and 826 transitions. [2018-12-08 18:01:01,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:01,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-08 18:01:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:01,823 INFO L225 Difference]: With dead ends: 536 [2018-12-08 18:01:01,823 INFO L226 Difference]: Without dead ends: 293 [2018-12-08 18:01:01,824 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-12-08 18:01:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-08 18:01:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2018-12-08 18:01:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2018-12-08 18:01:01,829 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 101 [2018-12-08 18:01:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:01,829 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2018-12-08 18:01:01,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2018-12-08 18:01:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 18:01:01,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:01,830 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-12-08 18:01:01,830 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:01,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1896088586, now seen corresponding path program 1 times [2018-12-08 18:01:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:01,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:01,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:01,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:01,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:01,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:01,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:01,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:01,866 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand 4 states. [2018-12-08 18:01:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:02,082 INFO L93 Difference]: Finished difference Result 571 states and 877 transitions. [2018-12-08 18:01:02,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:02,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-08 18:01:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:02,083 INFO L225 Difference]: With dead ends: 571 [2018-12-08 18:01:02,083 INFO L226 Difference]: Without dead ends: 328 [2018-12-08 18:01:02,084 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-12-08 18:01:02,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-08 18:01:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 268. [2018-12-08 18:01:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2018-12-08 18:01:02,090 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 102 [2018-12-08 18:01:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:02,091 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2018-12-08 18:01:02,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2018-12-08 18:01:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 18:01:02,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:02,091 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-12-08 18:01:02,092 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:02,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1828528585, now seen corresponding path program 1 times [2018-12-08 18:01:02,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:02,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:02,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:02,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:02,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:02,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:02,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:02,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:02,137 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 4 states. [2018-12-08 18:01:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:02,332 INFO L93 Difference]: Finished difference Result 570 states and 874 transitions. [2018-12-08 18:01:02,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:02,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-08 18:01:02,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:02,333 INFO L225 Difference]: With dead ends: 570 [2018-12-08 18:01:02,333 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 18:01:02,333 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-12-08 18:01:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 18:01:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-08 18:01:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 408 transitions. [2018-12-08 18:01:02,339 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 408 transitions. Word has length 102 [2018-12-08 18:01:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:02,339 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 408 transitions. [2018-12-08 18:01:02,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 408 transitions. [2018-12-08 18:01:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 18:01:02,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:02,340 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-12-08 18:01:02,340 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:02,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash -509303176, now seen corresponding path program 1 times [2018-12-08 18:01:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:02,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:02,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:02,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:02,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:02,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:02,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:02,372 INFO L87 Difference]: Start difference. First operand 268 states and 408 transitions. Second operand 4 states. [2018-12-08 18:01:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:02,552 INFO L93 Difference]: Finished difference Result 534 states and 818 transitions. [2018-12-08 18:01:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:02,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-08 18:01:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:02,553 INFO L225 Difference]: With dead ends: 534 [2018-12-08 18:01:02,553 INFO L226 Difference]: Without dead ends: 291 [2018-12-08 18:01:02,553 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-12-08 18:01:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-08 18:01:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 268. [2018-12-08 18:01:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 407 transitions. [2018-12-08 18:01:02,562 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 407 transitions. Word has length 102 [2018-12-08 18:01:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:02,562 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 407 transitions. [2018-12-08 18:01:02,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 407 transitions. [2018-12-08 18:01:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 18:01:02,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:02,562 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-12-08 18:01:02,562 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:02,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash -441743175, now seen corresponding path program 1 times [2018-12-08 18:01:02,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:02,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:02,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:02,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:02,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:02,602 INFO L87 Difference]: Start difference. First operand 268 states and 407 transitions. Second operand 4 states. [2018-12-08 18:01:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:02,744 INFO L93 Difference]: Finished difference Result 533 states and 815 transitions. [2018-12-08 18:01:02,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:02,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-08 18:01:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:02,745 INFO L225 Difference]: With dead ends: 533 [2018-12-08 18:01:02,745 INFO L226 Difference]: Without dead ends: 290 [2018-12-08 18:01:02,745 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-12-08 18:01:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-08 18:01:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-08 18:01:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2018-12-08 18:01:02,754 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 102 [2018-12-08 18:01:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:02,754 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2018-12-08 18:01:02,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2018-12-08 18:01:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 18:01:02,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:02,755 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-12-08 18:01:02,756 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:02,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2131072420, now seen corresponding path program 1 times [2018-12-08 18:01:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:02,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:02,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:02,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:02,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:02,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:02,793 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand 4 states. [2018-12-08 18:01:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:02,989 INFO L93 Difference]: Finished difference Result 570 states and 868 transitions. [2018-12-08 18:01:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:02,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-08 18:01:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:02,990 INFO L225 Difference]: With dead ends: 570 [2018-12-08 18:01:02,990 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 18:01:02,990 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-12-08 18:01:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 18:01:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-08 18:01:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 405 transitions. [2018-12-08 18:01:02,996 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 405 transitions. Word has length 103 [2018-12-08 18:01:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:02,996 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 405 transitions. [2018-12-08 18:01:02,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 405 transitions. [2018-12-08 18:01:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 18:01:02,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:02,997 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-12-08 18:01:02,997 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:02,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2123220126, now seen corresponding path program 1 times [2018-12-08 18:01:02,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:02,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:02,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:03,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:03,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:03,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:03,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:03,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:03,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:03,022 INFO L87 Difference]: Start difference. First operand 268 states and 405 transitions. Second operand 4 states. [2018-12-08 18:01:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:03,184 INFO L93 Difference]: Finished difference Result 533 states and 811 transitions. [2018-12-08 18:01:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:03,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-08 18:01:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:03,185 INFO L225 Difference]: With dead ends: 533 [2018-12-08 18:01:03,185 INFO L226 Difference]: Without dead ends: 290 [2018-12-08 18:01:03,186 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-12-08 18:01:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-08 18:01:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-08 18:01:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2018-12-08 18:01:03,191 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 103 [2018-12-08 18:01:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:03,191 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2018-12-08 18:01:03,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2018-12-08 18:01:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 18:01:03,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:03,192 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-12-08 18:01:03,192 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:03,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1865437939, now seen corresponding path program 1 times [2018-12-08 18:01:03,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:03,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:03,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:03,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:03,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:03,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:03,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:03,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:03,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:03,226 INFO L87 Difference]: Start difference. First operand 268 states and 404 transitions. Second operand 4 states. [2018-12-08 18:01:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:03,456 INFO L93 Difference]: Finished difference Result 570 states and 864 transitions. [2018-12-08 18:01:03,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:03,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-08 18:01:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:03,457 INFO L225 Difference]: With dead ends: 570 [2018-12-08 18:01:03,457 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 18:01:03,458 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-12-08 18:01:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 18:01:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-08 18:01:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 403 transitions. [2018-12-08 18:01:03,468 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 403 transitions. Word has length 104 [2018-12-08 18:01:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:03,468 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 403 transitions. [2018-12-08 18:01:03,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 403 transitions. [2018-12-08 18:01:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 18:01:03,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:03,469 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-12-08 18:01:03,469 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:03,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1168612107, now seen corresponding path program 1 times [2018-12-08 18:01:03,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:03,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:03,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:03,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:03,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:03,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:03,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:03,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:03,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:03,514 INFO L87 Difference]: Start difference. First operand 268 states and 403 transitions. Second operand 4 states. [2018-12-08 18:01:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:03,696 INFO L93 Difference]: Finished difference Result 533 states and 807 transitions. [2018-12-08 18:01:03,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:03,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-08 18:01:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:03,697 INFO L225 Difference]: With dead ends: 533 [2018-12-08 18:01:03,697 INFO L226 Difference]: Without dead ends: 290 [2018-12-08 18:01:03,697 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-12-08 18:01:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-08 18:01:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-08 18:01:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 402 transitions. [2018-12-08 18:01:03,703 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 402 transitions. Word has length 104 [2018-12-08 18:01:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:03,703 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 402 transitions. [2018-12-08 18:01:03,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 402 transitions. [2018-12-08 18:01:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 18:01:03,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:03,704 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-12-08 18:01:03,704 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:03,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1521325857, now seen corresponding path program 1 times [2018-12-08 18:01:03,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:03,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:03,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:03,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:03,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:03,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:03,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:03,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:03,749 INFO L87 Difference]: Start difference. First operand 268 states and 402 transitions. Second operand 4 states. [2018-12-08 18:01:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:03,991 INFO L93 Difference]: Finished difference Result 570 states and 860 transitions. [2018-12-08 18:01:03,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:03,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-08 18:01:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:03,992 INFO L225 Difference]: With dead ends: 570 [2018-12-08 18:01:03,992 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 18:01:03,993 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-12-08 18:01:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 18:01:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2018-12-08 18:01:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 401 transitions. [2018-12-08 18:01:03,999 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 401 transitions. Word has length 105 [2018-12-08 18:01:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:04,000 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 401 transitions. [2018-12-08 18:01:04,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2018-12-08 18:01:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 18:01:04,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:04,000 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-12-08 18:01:04,000 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:04,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1087596771, now seen corresponding path program 1 times [2018-12-08 18:01:04,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:04,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:04,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:04,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:04,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:04,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:04,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:04,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:04,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:04,044 INFO L87 Difference]: Start difference. First operand 268 states and 401 transitions. Second operand 4 states. [2018-12-08 18:01:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:04,204 INFO L93 Difference]: Finished difference Result 533 states and 803 transitions. [2018-12-08 18:01:04,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:04,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-08 18:01:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:04,205 INFO L225 Difference]: With dead ends: 533 [2018-12-08 18:01:04,205 INFO L226 Difference]: Without dead ends: 290 [2018-12-08 18:01:04,205 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-12-08 18:01:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-08 18:01:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2018-12-08 18:01:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 400 transitions. [2018-12-08 18:01:04,212 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 400 transitions. Word has length 105 [2018-12-08 18:01:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 400 transitions. [2018-12-08 18:01:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 400 transitions. [2018-12-08 18:01:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 18:01:04,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:04,213 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-12-08 18:01:04,213 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:04,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1416116686, now seen corresponding path program 1 times [2018-12-08 18:01:04,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:04,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:04,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:04,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:04,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:04,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:04,255 INFO L87 Difference]: Start difference. First operand 268 states and 400 transitions. Second operand 4 states. [2018-12-08 18:01:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:04,444 INFO L93 Difference]: Finished difference Result 560 states and 844 transitions. [2018-12-08 18:01:04,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:04,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-08 18:01:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:04,445 INFO L225 Difference]: With dead ends: 560 [2018-12-08 18:01:04,445 INFO L226 Difference]: Without dead ends: 317 [2018-12-08 18:01:04,446 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-12-08 18:01:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-08 18:01:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2018-12-08 18:01:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 399 transitions. [2018-12-08 18:01:04,452 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 399 transitions. Word has length 106 [2018-12-08 18:01:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:04,453 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 399 transitions. [2018-12-08 18:01:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 399 transitions. [2018-12-08 18:01:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 18:01:04,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:04,453 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-12-08 18:01:04,453 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:04,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1976816464, now seen corresponding path program 1 times [2018-12-08 18:01:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:04,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:04,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:04,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:04,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:04,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:04,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:04,483 INFO L87 Difference]: Start difference. First operand 268 states and 399 transitions. Second operand 4 states. [2018-12-08 18:01:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:04,619 INFO L93 Difference]: Finished difference Result 523 states and 787 transitions. [2018-12-08 18:01:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:04,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-08 18:01:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:04,621 INFO L225 Difference]: With dead ends: 523 [2018-12-08 18:01:04,621 INFO L226 Difference]: Without dead ends: 280 [2018-12-08 18:01:04,621 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-12-08 18:01:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-08 18:01:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 268. [2018-12-08 18:01:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 398 transitions. [2018-12-08 18:01:04,632 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 398 transitions. Word has length 106 [2018-12-08 18:01:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:04,633 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 398 transitions. [2018-12-08 18:01:04,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 398 transitions. [2018-12-08 18:01:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 18:01:04,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:04,634 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-12-08 18:01:04,634 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:04,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:04,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1089467252, now seen corresponding path program 1 times [2018-12-08 18:01:04,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:04,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:04,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:04,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:04,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:04,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:04,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:04,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:04,681 INFO L87 Difference]: Start difference. First operand 268 states and 398 transitions. Second operand 4 states. [2018-12-08 18:01:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:04,983 INFO L93 Difference]: Finished difference Result 560 states and 840 transitions. [2018-12-08 18:01:04,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:04,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-08 18:01:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:04,987 INFO L225 Difference]: With dead ends: 560 [2018-12-08 18:01:04,987 INFO L226 Difference]: Without dead ends: 317 [2018-12-08 18:01:04,988 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-12-08 18:01:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-08 18:01:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2018-12-08 18:01:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 18:01:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 397 transitions. [2018-12-08 18:01:05,006 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 397 transitions. Word has length 110 [2018-12-08 18:01:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:05,007 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 397 transitions. [2018-12-08 18:01:05,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 397 transitions. [2018-12-08 18:01:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 18:01:05,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:05,008 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-12-08 18:01:05,008 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:05,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash 672070646, now seen corresponding path program 1 times [2018-12-08 18:01:05,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:05,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:05,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:05,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:05,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:05,049 INFO L87 Difference]: Start difference. First operand 268 states and 397 transitions. Second operand 4 states. [2018-12-08 18:01:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:05,212 INFO L93 Difference]: Finished difference Result 564 states and 847 transitions. [2018-12-08 18:01:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:05,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-08 18:01:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:05,213 INFO L225 Difference]: With dead ends: 564 [2018-12-08 18:01:05,213 INFO L226 Difference]: Without dead ends: 321 [2018-12-08 18:01:05,213 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-12-08 18:01:05,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-08 18:01:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 294. [2018-12-08 18:01:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2018-12-08 18:01:05,220 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 110 [2018-12-08 18:01:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:05,220 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2018-12-08 18:01:05,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2018-12-08 18:01:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 18:01:05,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:05,221 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-12-08 18:01:05,221 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:05,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:05,221 INFO L82 PathProgramCache]: Analyzing trace with hash -40281660, now seen corresponding path program 1 times [2018-12-08 18:01:05,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:05,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:05,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:05,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:05,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:05,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:05,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:05,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:05,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:05,253 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand 4 states. [2018-12-08 18:01:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:05,445 INFO L93 Difference]: Finished difference Result 612 states and 928 transitions. [2018-12-08 18:01:05,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:05,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-08 18:01:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:05,446 INFO L225 Difference]: With dead ends: 612 [2018-12-08 18:01:05,446 INFO L226 Difference]: Without dead ends: 343 [2018-12-08 18:01:05,446 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-12-08 18:01:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-08 18:01:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2018-12-08 18:01:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 441 transitions. [2018-12-08 18:01:05,454 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 441 transitions. Word has length 113 [2018-12-08 18:01:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:05,454 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 441 transitions. [2018-12-08 18:01:05,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 441 transitions. [2018-12-08 18:01:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 18:01:05,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:05,455 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-12-08 18:01:05,455 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:05,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1287322451, now seen corresponding path program 1 times [2018-12-08 18:01:05,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:05,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:05,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:05,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:05,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:05,486 INFO L87 Difference]: Start difference. First operand 294 states and 441 transitions. Second operand 4 states. [2018-12-08 18:01:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:05,658 INFO L93 Difference]: Finished difference Result 604 states and 913 transitions. [2018-12-08 18:01:05,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:05,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-08 18:01:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:05,659 INFO L225 Difference]: With dead ends: 604 [2018-12-08 18:01:05,659 INFO L226 Difference]: Without dead ends: 335 [2018-12-08 18:01:05,660 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-12-08 18:01:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-08 18:01:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2018-12-08 18:01:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 440 transitions. [2018-12-08 18:01:05,669 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 440 transitions. Word has length 114 [2018-12-08 18:01:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:05,669 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 440 transitions. [2018-12-08 18:01:05,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 440 transitions. [2018-12-08 18:01:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 18:01:05,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:05,669 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-12-08 18:01:05,669 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:05,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2011081572, now seen corresponding path program 1 times [2018-12-08 18:01:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:05,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:05,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:05,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:05,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:05,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:05,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:05,710 INFO L87 Difference]: Start difference. First operand 294 states and 440 transitions. Second operand 4 states. [2018-12-08 18:01:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:05,948 INFO L93 Difference]: Finished difference Result 604 states and 911 transitions. [2018-12-08 18:01:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:05,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-08 18:01:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:05,949 INFO L225 Difference]: With dead ends: 604 [2018-12-08 18:01:05,949 INFO L226 Difference]: Without dead ends: 335 [2018-12-08 18:01:05,949 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-12-08 18:01:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-08 18:01:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2018-12-08 18:01:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2018-12-08 18:01:05,957 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 115 [2018-12-08 18:01:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:05,957 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2018-12-08 18:01:05,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2018-12-08 18:01:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 18:01:05,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:05,958 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-12-08 18:01:05,958 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:05,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:05,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2114530549, now seen corresponding path program 1 times [2018-12-08 18:01:05,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:05,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:05,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:05,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:06,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:06,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:06,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:06,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:06,006 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand 4 states. [2018-12-08 18:01:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:06,200 INFO L93 Difference]: Finished difference Result 604 states and 909 transitions. [2018-12-08 18:01:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:06,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-08 18:01:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:06,201 INFO L225 Difference]: With dead ends: 604 [2018-12-08 18:01:06,201 INFO L226 Difference]: Without dead ends: 335 [2018-12-08 18:01:06,201 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-12-08 18:01:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-08 18:01:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2018-12-08 18:01:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 438 transitions. [2018-12-08 18:01:06,211 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 438 transitions. Word has length 116 [2018-12-08 18:01:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:06,211 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 438 transitions. [2018-12-08 18:01:06,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 438 transitions. [2018-12-08 18:01:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 18:01:06,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:06,211 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-12-08 18:01:06,211 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:06,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 610228371, now seen corresponding path program 1 times [2018-12-08 18:01:06,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:06,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:06,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:06,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:06,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:06,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:06,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:06,252 INFO L87 Difference]: Start difference. First operand 294 states and 438 transitions. Second operand 4 states. [2018-12-08 18:01:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:06,439 INFO L93 Difference]: Finished difference Result 602 states and 905 transitions. [2018-12-08 18:01:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:06,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-08 18:01:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:06,440 INFO L225 Difference]: With dead ends: 602 [2018-12-08 18:01:06,440 INFO L226 Difference]: Without dead ends: 333 [2018-12-08 18:01:06,440 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-12-08 18:01:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-08 18:01:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 294. [2018-12-08 18:01:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 437 transitions. [2018-12-08 18:01:06,450 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 437 transitions. Word has length 116 [2018-12-08 18:01:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:06,450 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 437 transitions. [2018-12-08 18:01:06,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 437 transitions. [2018-12-08 18:01:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 18:01:06,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:06,451 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-12-08 18:01:06,451 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:06,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1668695618, now seen corresponding path program 1 times [2018-12-08 18:01:06,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:06,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:06,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:06,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:06,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:06,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:06,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:06,493 INFO L87 Difference]: Start difference. First operand 294 states and 437 transitions. Second operand 4 states. [2018-12-08 18:01:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:06,663 INFO L93 Difference]: Finished difference Result 599 states and 899 transitions. [2018-12-08 18:01:06,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:06,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-08 18:01:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:06,665 INFO L225 Difference]: With dead ends: 599 [2018-12-08 18:01:06,665 INFO L226 Difference]: Without dead ends: 330 [2018-12-08 18:01:06,666 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-12-08 18:01:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-08 18:01:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 294. [2018-12-08 18:01:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 436 transitions. [2018-12-08 18:01:06,675 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 436 transitions. Word has length 117 [2018-12-08 18:01:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:06,675 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 436 transitions. [2018-12-08 18:01:06,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 436 transitions. [2018-12-08 18:01:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 18:01:06,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:06,676 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-12-08 18:01:06,676 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:06,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2016215676, now seen corresponding path program 1 times [2018-12-08 18:01:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:06,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:06,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:06,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:06,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:06,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:06,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:06,713 INFO L87 Difference]: Start difference. First operand 294 states and 436 transitions. Second operand 4 states. [2018-12-08 18:01:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:06,920 INFO L93 Difference]: Finished difference Result 597 states and 894 transitions. [2018-12-08 18:01:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:06,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-08 18:01:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:06,922 INFO L225 Difference]: With dead ends: 597 [2018-12-08 18:01:06,923 INFO L226 Difference]: Without dead ends: 328 [2018-12-08 18:01:06,923 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-12-08 18:01:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-08 18:01:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2018-12-08 18:01:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 435 transitions. [2018-12-08 18:01:06,938 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 435 transitions. Word has length 117 [2018-12-08 18:01:06,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:06,938 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 435 transitions. [2018-12-08 18:01:06,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 435 transitions. [2018-12-08 18:01:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 18:01:06,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:06,939 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, 1] [2018-12-08 18:01:06,939 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:06,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:06,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1432426067, now seen corresponding path program 1 times [2018-12-08 18:01:06,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:06,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:06,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:06,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:06,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:06,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:06,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:06,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:06,977 INFO L87 Difference]: Start difference. First operand 294 states and 435 transitions. Second operand 4 states. [2018-12-08 18:01:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:07,143 INFO L93 Difference]: Finished difference Result 597 states and 892 transitions. [2018-12-08 18:01:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:07,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-08 18:01:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:07,144 INFO L225 Difference]: With dead ends: 597 [2018-12-08 18:01:07,144 INFO L226 Difference]: Without dead ends: 328 [2018-12-08 18:01:07,145 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-12-08 18:01:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-08 18:01:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2018-12-08 18:01:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2018-12-08 18:01:07,153 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 120 [2018-12-08 18:01:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:07,153 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2018-12-08 18:01:07,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2018-12-08 18:01:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 18:01:07,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:07,154 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, 1] [2018-12-08 18:01:07,154 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:07,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:07,154 INFO L82 PathProgramCache]: Analyzing trace with hash -942816935, now seen corresponding path program 1 times [2018-12-08 18:01:07,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:07,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:07,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:07,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:07,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:07,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:07,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:07,191 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand 4 states. [2018-12-08 18:01:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:07,351 INFO L93 Difference]: Finished difference Result 591 states and 881 transitions. [2018-12-08 18:01:07,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:07,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-08 18:01:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:07,352 INFO L225 Difference]: With dead ends: 591 [2018-12-08 18:01:07,352 INFO L226 Difference]: Without dead ends: 322 [2018-12-08 18:01:07,353 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-12-08 18:01:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-08 18:01:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2018-12-08 18:01:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 433 transitions. [2018-12-08 18:01:07,362 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 433 transitions. Word has length 121 [2018-12-08 18:01:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:07,362 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 433 transitions. [2018-12-08 18:01:07,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 433 transitions. [2018-12-08 18:01:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 18:01:07,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:07,363 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, 1] [2018-12-08 18:01:07,363 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:07,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1042390380, now seen corresponding path program 1 times [2018-12-08 18:01:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:07,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:07,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:07,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:07,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:07,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:07,406 INFO L87 Difference]: Start difference. First operand 294 states and 433 transitions. Second operand 4 states. [2018-12-08 18:01:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:07,578 INFO L93 Difference]: Finished difference Result 591 states and 879 transitions. [2018-12-08 18:01:07,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:07,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-08 18:01:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:07,579 INFO L225 Difference]: With dead ends: 591 [2018-12-08 18:01:07,579 INFO L226 Difference]: Without dead ends: 322 [2018-12-08 18:01:07,580 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-12-08 18:01:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-08 18:01:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2018-12-08 18:01:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 432 transitions. [2018-12-08 18:01:07,588 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 432 transitions. Word has length 121 [2018-12-08 18:01:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:07,588 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 432 transitions. [2018-12-08 18:01:07,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 432 transitions. [2018-12-08 18:01:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 18:01:07,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:07,589 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, 1] [2018-12-08 18:01:07,589 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:07,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1821394680, now seen corresponding path program 1 times [2018-12-08 18:01:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:07,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:07,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:07,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:07,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:07,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:07,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:07,627 INFO L87 Difference]: Start difference. First operand 294 states and 432 transitions. Second operand 4 states. [2018-12-08 18:01:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:07,804 INFO L93 Difference]: Finished difference Result 588 states and 873 transitions. [2018-12-08 18:01:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:07,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-08 18:01:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:07,805 INFO L225 Difference]: With dead ends: 588 [2018-12-08 18:01:07,805 INFO L226 Difference]: Without dead ends: 319 [2018-12-08 18:01:07,806 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-12-08 18:01:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-08 18:01:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2018-12-08 18:01:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions. [2018-12-08 18:01:07,816 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 122 [2018-12-08 18:01:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:07,817 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 431 transitions. [2018-12-08 18:01:07,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions. [2018-12-08 18:01:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 18:01:07,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:07,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, 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-12-08 18:01:07,817 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:07,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:07,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1595635660, now seen corresponding path program 1 times [2018-12-08 18:01:07,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:07,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:07,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:07,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:07,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:07,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:07,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:07,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:07,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:07,853 INFO L87 Difference]: Start difference. First operand 294 states and 431 transitions. Second operand 4 states. [2018-12-08 18:01:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:08,018 INFO L93 Difference]: Finished difference Result 588 states and 871 transitions. [2018-12-08 18:01:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:08,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-08 18:01:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:08,019 INFO L225 Difference]: With dead ends: 588 [2018-12-08 18:01:08,019 INFO L226 Difference]: Without dead ends: 319 [2018-12-08 18:01:08,020 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-12-08 18:01:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-08 18:01:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2018-12-08 18:01:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-08 18:01:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 430 transitions. [2018-12-08 18:01:08,029 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 430 transitions. Word has length 123 [2018-12-08 18:01:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:08,029 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 430 transitions. [2018-12-08 18:01:08,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 430 transitions. [2018-12-08 18:01:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-08 18:01:08,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:08,029 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-12-08 18:01:08,029 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:08,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash -220009708, now seen corresponding path program 1 times [2018-12-08 18:01:08,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:08,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:08,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 18:01:08,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:08,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:08,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:08,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:08,068 INFO L87 Difference]: Start difference. First operand 294 states and 430 transitions. Second operand 4 states. [2018-12-08 18:01:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:08,259 INFO L93 Difference]: Finished difference Result 635 states and 944 transitions. [2018-12-08 18:01:08,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:08,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-08 18:01:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:08,260 INFO L225 Difference]: With dead ends: 635 [2018-12-08 18:01:08,260 INFO L226 Difference]: Without dead ends: 366 [2018-12-08 18:01:08,261 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-12-08 18:01:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-08 18:01:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 326. [2018-12-08 18:01:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-12-08 18:01:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2018-12-08 18:01:08,270 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 123 [2018-12-08 18:01:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:08,270 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2018-12-08 18:01:08,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2018-12-08 18:01:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 18:01:08,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:08,271 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, 1] [2018-12-08 18:01:08,271 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:08,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1519794656, now seen corresponding path program 1 times [2018-12-08 18:01:08,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:08,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:08,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:08,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:08,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:08,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:08,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:08,308 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand 4 states. [2018-12-08 18:01:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:08,471 INFO L93 Difference]: Finished difference Result 649 states and 979 transitions. [2018-12-08 18:01:08,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:08,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-08 18:01:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:08,472 INFO L225 Difference]: With dead ends: 649 [2018-12-08 18:01:08,472 INFO L226 Difference]: Without dead ends: 348 [2018-12-08 18:01:08,472 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-12-08 18:01:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-12-08 18:01:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 326. [2018-12-08 18:01:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-12-08 18:01:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2018-12-08 18:01:08,483 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 124 [2018-12-08 18:01:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:08,483 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2018-12-08 18:01:08,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2018-12-08 18:01:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 18:01:08,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:08,483 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-12-08 18:01:08,483 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:08,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:08,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1732868330, now seen corresponding path program 1 times [2018-12-08 18:01:08,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:08,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:08,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:08,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:08,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:08,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:08,517 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand 4 states. [2018-12-08 18:01:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:08,750 INFO L93 Difference]: Finished difference Result 737 states and 1116 transitions. [2018-12-08 18:01:08,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:08,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-08 18:01:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:08,753 INFO L225 Difference]: With dead ends: 737 [2018-12-08 18:01:08,753 INFO L226 Difference]: Without dead ends: 436 [2018-12-08 18:01:08,753 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-12-08 18:01:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-12-08 18:01:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 365. [2018-12-08 18:01:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-08 18:01:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 557 transitions. [2018-12-08 18:01:08,766 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 557 transitions. Word has length 124 [2018-12-08 18:01:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:08,767 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 557 transitions. [2018-12-08 18:01:08,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 557 transitions. [2018-12-08 18:01:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 18:01:08,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:08,768 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-12-08 18:01:08,768 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:08,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash 865227089, now seen corresponding path program 1 times [2018-12-08 18:01:08,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:08,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:08,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:08,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:08,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:08,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:08,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:08,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:08,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:08,809 INFO L87 Difference]: Start difference. First operand 365 states and 557 transitions. Second operand 4 states. [2018-12-08 18:01:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:08,969 INFO L93 Difference]: Finished difference Result 732 states and 1121 transitions. [2018-12-08 18:01:08,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:08,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-08 18:01:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:08,970 INFO L225 Difference]: With dead ends: 732 [2018-12-08 18:01:08,970 INFO L226 Difference]: Without dead ends: 392 [2018-12-08 18:01:08,970 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-12-08 18:01:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-08 18:01:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2018-12-08 18:01:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-08 18:01:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 556 transitions. [2018-12-08 18:01:08,981 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 556 transitions. Word has length 125 [2018-12-08 18:01:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:08,981 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 556 transitions. [2018-12-08 18:01:08,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 556 transitions. [2018-12-08 18:01:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 18:01:08,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:08,981 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-12-08 18:01:08,981 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:08,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash -974076472, now seen corresponding path program 1 times [2018-12-08 18:01:08,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:08,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:08,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:08,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:09,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:09,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:09,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:09,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:09,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:09,016 INFO L87 Difference]: Start difference. First operand 365 states and 556 transitions. Second operand 4 states. [2018-12-08 18:01:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:09,266 INFO L93 Difference]: Finished difference Result 768 states and 1173 transitions. [2018-12-08 18:01:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:09,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-08 18:01:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:09,268 INFO L225 Difference]: With dead ends: 768 [2018-12-08 18:01:09,268 INFO L226 Difference]: Without dead ends: 428 [2018-12-08 18:01:09,268 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-12-08 18:01:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-08 18:01:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 364. [2018-12-08 18:01:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-08 18:01:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 555 transitions. [2018-12-08 18:01:09,280 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 555 transitions. Word has length 125 [2018-12-08 18:01:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:09,280 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 555 transitions. [2018-12-08 18:01:09,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 555 transitions. [2018-12-08 18:01:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-08 18:01:09,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:09,281 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-12-08 18:01:09,281 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:09,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1278938342, now seen corresponding path program 1 times [2018-12-08 18:01:09,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:09,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:09,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:09,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:09,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:09,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:09,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:09,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:09,313 INFO L87 Difference]: Start difference. First operand 364 states and 555 transitions. Second operand 4 states. [2018-12-08 18:01:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:09,484 INFO L93 Difference]: Finished difference Result 730 states and 1117 transitions. [2018-12-08 18:01:09,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:09,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-08 18:01:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:09,485 INFO L225 Difference]: With dead ends: 730 [2018-12-08 18:01:09,485 INFO L226 Difference]: Without dead ends: 391 [2018-12-08 18:01:09,485 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-12-08 18:01:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-08 18:01:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2018-12-08 18:01:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-08 18:01:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 554 transitions. [2018-12-08 18:01:09,496 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 554 transitions. Word has length 126 [2018-12-08 18:01:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:09,497 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 554 transitions. [2018-12-08 18:01:09,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 554 transitions. [2018-12-08 18:01:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 18:01:09,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:09,497 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-12-08 18:01:09,497 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:09,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:09,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1772023116, now seen corresponding path program 1 times [2018-12-08 18:01:09,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:09,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:09,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:09,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:09,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:09,530 INFO L87 Difference]: Start difference. First operand 364 states and 554 transitions. Second operand 4 states. [2018-12-08 18:01:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:09,696 INFO L93 Difference]: Finished difference Result 730 states and 1115 transitions. [2018-12-08 18:01:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:09,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-08 18:01:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:09,697 INFO L225 Difference]: With dead ends: 730 [2018-12-08 18:01:09,697 INFO L226 Difference]: Without dead ends: 391 [2018-12-08 18:01:09,698 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-12-08 18:01:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-08 18:01:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2018-12-08 18:01:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-08 18:01:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2018-12-08 18:01:09,709 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 127 [2018-12-08 18:01:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:09,709 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2018-12-08 18:01:09,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2018-12-08 18:01:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-08 18:01:09,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:09,709 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-12-08 18:01:09,709 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:09,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:09,710 INFO L82 PathProgramCache]: Analyzing trace with hash 430719745, now seen corresponding path program 1 times [2018-12-08 18:01:09,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:09,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:09,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:09,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:09,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:09,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:09,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:09,748 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 4 states. [2018-12-08 18:01:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:09,908 INFO L93 Difference]: Finished difference Result 720 states and 1101 transitions. [2018-12-08 18:01:09,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:09,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-08 18:01:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:09,909 INFO L225 Difference]: With dead ends: 720 [2018-12-08 18:01:09,909 INFO L226 Difference]: Without dead ends: 381 [2018-12-08 18:01:09,909 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-12-08 18:01:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-08 18:01:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 364. [2018-12-08 18:01:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-08 18:01:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2018-12-08 18:01:09,921 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 128 [2018-12-08 18:01:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:09,921 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2018-12-08 18:01:09,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2018-12-08 18:01:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 18:01:09,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:09,922 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-12-08 18:01:09,922 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:09,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:09,923 INFO L82 PathProgramCache]: Analyzing trace with hash -914002453, now seen corresponding path program 1 times [2018-12-08 18:01:09,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:09,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:09,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:09,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:09,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:09,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:01:09,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:09,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:01:09,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:01:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:01:09,959 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand 3 states. [2018-12-08 18:01:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:10,026 INFO L93 Difference]: Finished difference Result 1038 states and 1595 transitions. [2018-12-08 18:01:10,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:01:10,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-12-08 18:01:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:10,028 INFO L225 Difference]: With dead ends: 1038 [2018-12-08 18:01:10,028 INFO L226 Difference]: Without dead ends: 699 [2018-12-08 18:01:10,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:01:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-08 18:01:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2018-12-08 18:01:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-08 18:01:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2018-12-08 18:01:10,051 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 129 [2018-12-08 18:01:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:10,051 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2018-12-08 18:01:10,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:01:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2018-12-08 18:01:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 18:01:10,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:10,052 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-12-08 18:01:10,052 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:10,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash 699750052, now seen corresponding path program 1 times [2018-12-08 18:01:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:10,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:10,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:10,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:10,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:10,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:10,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:10,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:10,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:10,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:10,091 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2018-12-08 18:01:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:10,385 INFO L93 Difference]: Finished difference Result 1585 states and 2412 transitions. [2018-12-08 18:01:10,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:10,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-12-08 18:01:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:10,387 INFO L225 Difference]: With dead ends: 1585 [2018-12-08 18:01:10,387 INFO L226 Difference]: Without dead ends: 913 [2018-12-08 18:01:10,388 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-12-08 18:01:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-12-08 18:01:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 775. [2018-12-08 18:01:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-12-08 18:01:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1197 transitions. [2018-12-08 18:01:10,412 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1197 transitions. Word has length 131 [2018-12-08 18:01:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:10,413 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 1197 transitions. [2018-12-08 18:01:10,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1197 transitions. [2018-12-08 18:01:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 18:01:10,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:10,413 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, 1, 1] [2018-12-08 18:01:10,413 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:10,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1358995278, now seen corresponding path program 1 times [2018-12-08 18:01:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:10,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:10,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:10,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:10,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:10,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:10,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:10,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:10,448 INFO L87 Difference]: Start difference. First operand 775 states and 1197 transitions. Second operand 4 states. [2018-12-08 18:01:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:10,710 INFO L93 Difference]: Finished difference Result 1651 states and 2537 transitions. [2018-12-08 18:01:10,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:10,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-12-08 18:01:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:10,713 INFO L225 Difference]: With dead ends: 1651 [2018-12-08 18:01:10,713 INFO L226 Difference]: Without dead ends: 901 [2018-12-08 18:01:10,714 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-12-08 18:01:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-12-08 18:01:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 697. [2018-12-08 18:01:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-08 18:01:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2018-12-08 18:01:10,746 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 132 [2018-12-08 18:01:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:10,746 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2018-12-08 18:01:10,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2018-12-08 18:01:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-08 18:01:10,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:10,747 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, 1, 1] [2018-12-08 18:01:10,747 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:10,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -609309176, now seen corresponding path program 1 times [2018-12-08 18:01:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:10,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:10,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:10,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:10,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:10,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:10,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:10,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:10,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:10,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:10,797 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2018-12-08 18:01:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:11,009 INFO L93 Difference]: Finished difference Result 1401 states and 2126 transitions. [2018-12-08 18:01:11,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:11,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-12-08 18:01:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:11,010 INFO L225 Difference]: With dead ends: 1401 [2018-12-08 18:01:11,011 INFO L226 Difference]: Without dead ends: 729 [2018-12-08 18:01:11,011 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-12-08 18:01:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-12-08 18:01:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-12-08 18:01:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-12-08 18:01:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1061 transitions. [2018-12-08 18:01:11,037 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1061 transitions. Word has length 133 [2018-12-08 18:01:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:11,037 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1061 transitions. [2018-12-08 18:01:11,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1061 transitions. [2018-12-08 18:01:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 18:01:11,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:11,038 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-12-08 18:01:11,038 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:11,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1516600717, now seen corresponding path program 1 times [2018-12-08 18:01:11,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:11,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:11,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:01:11,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:11,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:11,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:11,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:11,072 INFO L87 Difference]: Start difference. First operand 703 states and 1061 transitions. Second operand 4 states. [2018-12-08 18:01:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:11,258 INFO L93 Difference]: Finished difference Result 1415 states and 2140 transitions. [2018-12-08 18:01:11,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:11,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-08 18:01:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:11,261 INFO L225 Difference]: With dead ends: 1415 [2018-12-08 18:01:11,261 INFO L226 Difference]: Without dead ends: 737 [2018-12-08 18:01:11,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-12-08 18:01:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-12-08 18:01:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 703. [2018-12-08 18:01:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-12-08 18:01:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1059 transitions. [2018-12-08 18:01:11,286 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1059 transitions. Word has length 138 [2018-12-08 18:01:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:11,286 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1059 transitions. [2018-12-08 18:01:11,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1059 transitions. [2018-12-08 18:01:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 18:01:11,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:11,287 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-12-08 18:01:11,287 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:11,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 907229310, now seen corresponding path program 1 times [2018-12-08 18:01:11,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:11,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:01:11,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:11,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:11,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:11,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:11,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:11,324 INFO L87 Difference]: Start difference. First operand 703 states and 1059 transitions. Second operand 4 states. [2018-12-08 18:01:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:11,542 INFO L93 Difference]: Finished difference Result 1507 states and 2286 transitions. [2018-12-08 18:01:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:11,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-08 18:01:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:11,543 INFO L225 Difference]: With dead ends: 1507 [2018-12-08 18:01:11,543 INFO L226 Difference]: Without dead ends: 829 [2018-12-08 18:01:11,544 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-12-08 18:01:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-08 18:01:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 759. [2018-12-08 18:01:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-08 18:01:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1157 transitions. [2018-12-08 18:01:11,571 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1157 transitions. Word has length 138 [2018-12-08 18:01:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:11,571 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1157 transitions. [2018-12-08 18:01:11,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1157 transitions. [2018-12-08 18:01:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 18:01:11,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:11,572 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-12-08 18:01:11,572 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:11,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1148557886, now seen corresponding path program 1 times [2018-12-08 18:01:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:01:11,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:11,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:11,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:11,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:11,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:11,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:11,612 INFO L87 Difference]: Start difference. First operand 759 states and 1157 transitions. Second operand 4 states. [2018-12-08 18:01:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:11,785 INFO L93 Difference]: Finished difference Result 1523 states and 2328 transitions. [2018-12-08 18:01:11,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:11,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-08 18:01:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:11,787 INFO L225 Difference]: With dead ends: 1523 [2018-12-08 18:01:11,787 INFO L226 Difference]: Without dead ends: 789 [2018-12-08 18:01:11,787 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-12-08 18:01:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-08 18:01:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 759. [2018-12-08 18:01:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-08 18:01:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1155 transitions. [2018-12-08 18:01:11,813 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1155 transitions. Word has length 139 [2018-12-08 18:01:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:11,813 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1155 transitions. [2018-12-08 18:01:11,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1155 transitions. [2018-12-08 18:01:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 18:01:11,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:11,814 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-12-08 18:01:11,814 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:11,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -6828579, now seen corresponding path program 1 times [2018-12-08 18:01:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:11,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:11,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:11,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:11,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:11,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:11,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:11,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:11,855 INFO L87 Difference]: Start difference. First operand 759 states and 1155 transitions. Second operand 4 states. [2018-12-08 18:01:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:12,110 INFO L93 Difference]: Finished difference Result 1697 states and 2593 transitions. [2018-12-08 18:01:12,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:12,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-08 18:01:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:12,112 INFO L225 Difference]: With dead ends: 1697 [2018-12-08 18:01:12,112 INFO L226 Difference]: Without dead ends: 963 [2018-12-08 18:01:12,113 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-12-08 18:01:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-08 18:01:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 783. [2018-12-08 18:01:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-08 18:01:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1189 transitions. [2018-12-08 18:01:12,139 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1189 transitions. Word has length 139 [2018-12-08 18:01:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:12,139 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1189 transitions. [2018-12-08 18:01:12,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1189 transitions. [2018-12-08 18:01:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 18:01:12,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:12,140 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-12-08 18:01:12,140 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:12,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:12,140 INFO L82 PathProgramCache]: Analyzing trace with hash 15016410, now seen corresponding path program 1 times [2018-12-08 18:01:12,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:12,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:12,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:12,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:12,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:12,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:12,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:12,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:12,177 INFO L87 Difference]: Start difference. First operand 783 states and 1189 transitions. Second operand 4 states. [2018-12-08 18:01:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:12,453 INFO L93 Difference]: Finished difference Result 1721 states and 2625 transitions. [2018-12-08 18:01:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:12,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-08 18:01:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:12,455 INFO L225 Difference]: With dead ends: 1721 [2018-12-08 18:01:12,455 INFO L226 Difference]: Without dead ends: 963 [2018-12-08 18:01:12,456 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-12-08 18:01:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-08 18:01:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 785. [2018-12-08 18:01:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-12-08 18:01:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1191 transitions. [2018-12-08 18:01:12,484 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1191 transitions. Word has length 140 [2018-12-08 18:01:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:12,485 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 1191 transitions. [2018-12-08 18:01:12,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1191 transitions. [2018-12-08 18:01:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-08 18:01:12,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:12,486 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-12-08 18:01:12,486 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:12,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1245148888, now seen corresponding path program 1 times [2018-12-08 18:01:12,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:12,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:12,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:12,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:12,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:12,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:12,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:12,523 INFO L87 Difference]: Start difference. First operand 785 states and 1191 transitions. Second operand 4 states. [2018-12-08 18:01:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:12,771 INFO L93 Difference]: Finished difference Result 1723 states and 2625 transitions. [2018-12-08 18:01:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:12,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-08 18:01:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:12,773 INFO L225 Difference]: With dead ends: 1723 [2018-12-08 18:01:12,773 INFO L226 Difference]: Without dead ends: 963 [2018-12-08 18:01:12,774 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-12-08 18:01:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-08 18:01:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 787. [2018-12-08 18:01:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-12-08 18:01:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1193 transitions. [2018-12-08 18:01:12,801 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1193 transitions. Word has length 141 [2018-12-08 18:01:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:12,801 INFO L480 AbstractCegarLoop]: Abstraction has 787 states and 1193 transitions. [2018-12-08 18:01:12,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1193 transitions. [2018-12-08 18:01:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 18:01:12,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:12,802 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-12-08 18:01:12,802 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:12,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1277487861, now seen corresponding path program 1 times [2018-12-08 18:01:12,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:12,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:12,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:12,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:12,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:12,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:12,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:12,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:12,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:12,833 INFO L87 Difference]: Start difference. First operand 787 states and 1193 transitions. Second operand 4 states. [2018-12-08 18:01:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:13,079 INFO L93 Difference]: Finished difference Result 1705 states and 2601 transitions. [2018-12-08 18:01:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:13,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-08 18:01:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:13,081 INFO L225 Difference]: With dead ends: 1705 [2018-12-08 18:01:13,081 INFO L226 Difference]: Without dead ends: 943 [2018-12-08 18:01:13,083 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-12-08 18:01:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-08 18:01:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 789. [2018-12-08 18:01:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-08 18:01:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1195 transitions. [2018-12-08 18:01:13,126 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1195 transitions. Word has length 142 [2018-12-08 18:01:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:13,126 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1195 transitions. [2018-12-08 18:01:13,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1195 transitions. [2018-12-08 18:01:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 18:01:13,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:13,127 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, 1, 1] [2018-12-08 18:01:13,127 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:13,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:13,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1974369053, now seen corresponding path program 1 times [2018-12-08 18:01:13,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:13,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:13,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:13,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:13,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:13,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:13,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:13,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:13,159 INFO L87 Difference]: Start difference. First operand 789 states and 1195 transitions. Second operand 4 states. [2018-12-08 18:01:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:13,423 INFO L93 Difference]: Finished difference Result 1727 states and 2625 transitions. [2018-12-08 18:01:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:13,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-08 18:01:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:13,426 INFO L225 Difference]: With dead ends: 1727 [2018-12-08 18:01:13,426 INFO L226 Difference]: Without dead ends: 963 [2018-12-08 18:01:13,427 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-12-08 18:01:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-08 18:01:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2018-12-08 18:01:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-08 18:01:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1193 transitions. [2018-12-08 18:01:13,456 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1193 transitions. Word has length 146 [2018-12-08 18:01:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:13,457 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1193 transitions. [2018-12-08 18:01:13,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1193 transitions. [2018-12-08 18:01:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 18:01:13,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:13,458 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, 1, 1] [2018-12-08 18:01:13,458 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:13,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash -849196140, now seen corresponding path program 1 times [2018-12-08 18:01:13,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:13,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:13,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:13,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:13,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:13,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:13,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:13,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:13,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:13,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:13,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:13,492 INFO L87 Difference]: Start difference. First operand 789 states and 1193 transitions. Second operand 4 states. [2018-12-08 18:01:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:13,784 INFO L93 Difference]: Finished difference Result 1727 states and 2621 transitions. [2018-12-08 18:01:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:13,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-08 18:01:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:13,786 INFO L225 Difference]: With dead ends: 1727 [2018-12-08 18:01:13,786 INFO L226 Difference]: Without dead ends: 963 [2018-12-08 18:01:13,787 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-12-08 18:01:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-08 18:01:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2018-12-08 18:01:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-08 18:01:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1191 transitions. [2018-12-08 18:01:13,817 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1191 transitions. Word has length 147 [2018-12-08 18:01:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:13,817 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1191 transitions. [2018-12-08 18:01:13,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1191 transitions. [2018-12-08 18:01:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 18:01:13,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:13,818 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, 1, 1] [2018-12-08 18:01:13,818 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:13,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:13,818 INFO L82 PathProgramCache]: Analyzing trace with hash 224363614, now seen corresponding path program 1 times [2018-12-08 18:01:13,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:13,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:13,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:13,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:13,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:13,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:13,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:13,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:13,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:13,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:13,851 INFO L87 Difference]: Start difference. First operand 789 states and 1191 transitions. Second operand 4 states. [2018-12-08 18:01:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:14,118 INFO L93 Difference]: Finished difference Result 1727 states and 2617 transitions. [2018-12-08 18:01:14,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:14,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-08 18:01:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:14,119 INFO L225 Difference]: With dead ends: 1727 [2018-12-08 18:01:14,119 INFO L226 Difference]: Without dead ends: 963 [2018-12-08 18:01:14,120 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-12-08 18:01:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-08 18:01:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2018-12-08 18:01:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-08 18:01:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1189 transitions. [2018-12-08 18:01:14,150 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1189 transitions. Word has length 148 [2018-12-08 18:01:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:14,150 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1189 transitions. [2018-12-08 18:01:14,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1189 transitions. [2018-12-08 18:01:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 18:01:14,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:14,151 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, 1, 1] [2018-12-08 18:01:14,151 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:14,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash -302084561, now seen corresponding path program 1 times [2018-12-08 18:01:14,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:14,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:14,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:14,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:14,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:14,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:14,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:14,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:14,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:14,191 INFO L87 Difference]: Start difference. First operand 789 states and 1189 transitions. Second operand 4 states. [2018-12-08 18:01:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:14,443 INFO L93 Difference]: Finished difference Result 1707 states and 2589 transitions. [2018-12-08 18:01:14,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:14,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-08 18:01:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:14,445 INFO L225 Difference]: With dead ends: 1707 [2018-12-08 18:01:14,445 INFO L226 Difference]: Without dead ends: 943 [2018-12-08 18:01:14,446 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-12-08 18:01:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-08 18:01:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 759. [2018-12-08 18:01:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-08 18:01:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1147 transitions. [2018-12-08 18:01:14,476 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1147 transitions. Word has length 149 [2018-12-08 18:01:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:14,476 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1147 transitions. [2018-12-08 18:01:14,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1147 transitions. [2018-12-08 18:01:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 18:01:14,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:14,477 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-12-08 18:01:14,477 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:14,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:14,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1649320259, now seen corresponding path program 1 times [2018-12-08 18:01:14,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:14,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:14,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:14,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:14,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:14,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:14,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:14,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:14,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:14,512 INFO L87 Difference]: Start difference. First operand 759 states and 1147 transitions. Second operand 4 states. [2018-12-08 18:01:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:14,752 INFO L93 Difference]: Finished difference Result 1677 states and 2545 transitions. [2018-12-08 18:01:14,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:14,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-08 18:01:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:14,753 INFO L225 Difference]: With dead ends: 1677 [2018-12-08 18:01:14,753 INFO L226 Difference]: Without dead ends: 943 [2018-12-08 18:01:14,754 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-12-08 18:01:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-08 18:01:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 815. [2018-12-08 18:01:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-12-08 18:01:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1237 transitions. [2018-12-08 18:01:14,785 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1237 transitions. Word has length 149 [2018-12-08 18:01:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:14,785 INFO L480 AbstractCegarLoop]: Abstraction has 815 states and 1237 transitions. [2018-12-08 18:01:14,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1237 transitions. [2018-12-08 18:01:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-08 18:01:14,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:14,786 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-12-08 18:01:14,786 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:14,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1348233862, now seen corresponding path program 1 times [2018-12-08 18:01:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:14,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:14,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:14,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:14,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:14,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:14,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:14,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:14,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:14,826 INFO L87 Difference]: Start difference. First operand 815 states and 1237 transitions. Second operand 4 states. [2018-12-08 18:01:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:15,071 INFO L93 Difference]: Finished difference Result 1717 states and 2607 transitions. [2018-12-08 18:01:15,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:15,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-08 18:01:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:15,072 INFO L225 Difference]: With dead ends: 1717 [2018-12-08 18:01:15,072 INFO L226 Difference]: Without dead ends: 927 [2018-12-08 18:01:15,073 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-12-08 18:01:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-08 18:01:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2018-12-08 18:01:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:01:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1239 transitions. [2018-12-08 18:01:15,109 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1239 transitions. Word has length 150 [2018-12-08 18:01:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:15,109 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1239 transitions. [2018-12-08 18:01:15,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1239 transitions. [2018-12-08 18:01:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 18:01:15,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:15,110 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-12-08 18:01:15,110 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:15,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1017694567, now seen corresponding path program 1 times [2018-12-08 18:01:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:15,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:15,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:15,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-08 18:01:15,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:15,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:15,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:15,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:15,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:15,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:15,150 INFO L87 Difference]: Start difference. First operand 817 states and 1239 transitions. Second operand 4 states. [2018-12-08 18:01:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:15,393 INFO L93 Difference]: Finished difference Result 1719 states and 2607 transitions. [2018-12-08 18:01:15,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:15,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-08 18:01:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:15,394 INFO L225 Difference]: With dead ends: 1719 [2018-12-08 18:01:15,394 INFO L226 Difference]: Without dead ends: 927 [2018-12-08 18:01:15,395 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-12-08 18:01:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-08 18:01:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2018-12-08 18:01:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:01:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1237 transitions. [2018-12-08 18:01:15,428 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1237 transitions. Word has length 152 [2018-12-08 18:01:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:15,429 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1237 transitions. [2018-12-08 18:01:15,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1237 transitions. [2018-12-08 18:01:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-08 18:01:15,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:15,429 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-12-08 18:01:15,430 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:15,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1892666934, now seen corresponding path program 1 times [2018-12-08 18:01:15,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:15,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:15,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:15,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:15,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-08 18:01:15,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:15,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:15,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:15,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:15,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:15,464 INFO L87 Difference]: Start difference. First operand 817 states and 1237 transitions. Second operand 4 states. [2018-12-08 18:01:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:15,727 INFO L93 Difference]: Finished difference Result 1715 states and 2599 transitions. [2018-12-08 18:01:15,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:15,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-08 18:01:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:15,730 INFO L225 Difference]: With dead ends: 1715 [2018-12-08 18:01:15,730 INFO L226 Difference]: Without dead ends: 923 [2018-12-08 18:01:15,731 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-12-08 18:01:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-08 18:01:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 817. [2018-12-08 18:01:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-08 18:01:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1235 transitions. [2018-12-08 18:01:15,767 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1235 transitions. Word has length 153 [2018-12-08 18:01:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:15,767 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1235 transitions. [2018-12-08 18:01:15,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1235 transitions. [2018-12-08 18:01:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-08 18:01:15,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:15,768 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-12-08 18:01:15,768 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:15,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2107713211, now seen corresponding path program 1 times [2018-12-08 18:01:15,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:15,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:15,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:15,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:15,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:15,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:15,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:15,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:15,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:15,804 INFO L87 Difference]: Start difference. First operand 817 states and 1235 transitions. Second operand 4 states. [2018-12-08 18:01:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:16,043 INFO L93 Difference]: Finished difference Result 1709 states and 2587 transitions. [2018-12-08 18:01:16,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:16,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-08 18:01:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:16,044 INFO L225 Difference]: With dead ends: 1709 [2018-12-08 18:01:16,044 INFO L226 Difference]: Without dead ends: 917 [2018-12-08 18:01:16,045 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-12-08 18:01:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-08 18:01:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 823. [2018-12-08 18:01:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 18:01:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1245 transitions. [2018-12-08 18:01:16,081 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1245 transitions. Word has length 153 [2018-12-08 18:01:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:16,081 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1245 transitions. [2018-12-08 18:01:16,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1245 transitions. [2018-12-08 18:01:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-08 18:01:16,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:16,082 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-12-08 18:01:16,082 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:16,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -494111799, now seen corresponding path program 1 times [2018-12-08 18:01:16,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:16,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:16,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:16,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:16,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:01:16,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:16,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:16,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:16,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:16,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:16,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:16,138 INFO L87 Difference]: Start difference. First operand 823 states and 1245 transitions. Second operand 4 states. [2018-12-08 18:01:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:16,378 INFO L93 Difference]: Finished difference Result 1691 states and 2558 transitions. [2018-12-08 18:01:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:16,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-08 18:01:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:16,379 INFO L225 Difference]: With dead ends: 1691 [2018-12-08 18:01:16,379 INFO L226 Difference]: Without dead ends: 893 [2018-12-08 18:01:16,380 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-12-08 18:01:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-08 18:01:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2018-12-08 18:01:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 18:01:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1243 transitions. [2018-12-08 18:01:16,414 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1243 transitions. Word has length 153 [2018-12-08 18:01:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:16,414 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1243 transitions. [2018-12-08 18:01:16,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1243 transitions. [2018-12-08 18:01:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 18:01:16,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:16,415 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-12-08 18:01:16,415 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:16,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2089105774, now seen corresponding path program 1 times [2018-12-08 18:01:16,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:16,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:16,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:01:16,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:16,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:16,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:16,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:16,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:16,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:16,451 INFO L87 Difference]: Start difference. First operand 823 states and 1243 transitions. Second operand 4 states. [2018-12-08 18:01:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:16,696 INFO L93 Difference]: Finished difference Result 1691 states and 2554 transitions. [2018-12-08 18:01:16,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:16,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-08 18:01:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:16,697 INFO L225 Difference]: With dead ends: 1691 [2018-12-08 18:01:16,697 INFO L226 Difference]: Without dead ends: 893 [2018-12-08 18:01:16,698 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-12-08 18:01:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-08 18:01:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2018-12-08 18:01:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 18:01:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1241 transitions. [2018-12-08 18:01:16,732 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1241 transitions. Word has length 154 [2018-12-08 18:01:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:16,732 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1241 transitions. [2018-12-08 18:01:16,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1241 transitions. [2018-12-08 18:01:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 18:01:16,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:16,733 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-12-08 18:01:16,733 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:16,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1117409732, now seen corresponding path program 1 times [2018-12-08 18:01:16,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:16,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:01:16,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:16,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:16,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:16,768 INFO L87 Difference]: Start difference. First operand 823 states and 1241 transitions. Second operand 4 states. [2018-12-08 18:01:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:17,003 INFO L93 Difference]: Finished difference Result 1691 states and 2550 transitions. [2018-12-08 18:01:17,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:17,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-08 18:01:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:17,004 INFO L225 Difference]: With dead ends: 1691 [2018-12-08 18:01:17,004 INFO L226 Difference]: Without dead ends: 893 [2018-12-08 18:01: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-12-08 18:01:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-08 18:01:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2018-12-08 18:01:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 18:01:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1239 transitions. [2018-12-08 18:01:17,039 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1239 transitions. Word has length 155 [2018-12-08 18:01:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:17,039 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1239 transitions. [2018-12-08 18:01:17,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1239 transitions. [2018-12-08 18:01:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 18:01:17,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:17,040 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, 1, 1] [2018-12-08 18:01:17,040 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:17,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash -833714621, now seen corresponding path program 1 times [2018-12-08 18:01:17,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:17,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:17,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:17,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:17,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:17,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:17,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:17,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:17,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:17,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:17,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:17,079 INFO L87 Difference]: Start difference. First operand 823 states and 1239 transitions. Second operand 4 states. [2018-12-08 18:01:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:17,334 INFO L93 Difference]: Finished difference Result 1741 states and 2621 transitions. [2018-12-08 18:01:17,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:17,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-08 18:01:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:17,335 INFO L225 Difference]: With dead ends: 1741 [2018-12-08 18:01:17,335 INFO L226 Difference]: Without dead ends: 943 [2018-12-08 18:01:17,336 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-12-08 18:01:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-08 18:01:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 823. [2018-12-08 18:01:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 18:01:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1237 transitions. [2018-12-08 18:01:17,371 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1237 transitions. Word has length 156 [2018-12-08 18:01:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:17,371 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1237 transitions. [2018-12-08 18:01:17,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1237 transitions. [2018-12-08 18:01:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 18:01:17,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:17,372 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, 1] [2018-12-08 18:01:17,372 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:17,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash -586582830, now seen corresponding path program 1 times [2018-12-08 18:01:17,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:17,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:17,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:17,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:17,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:17,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:17,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:17,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:17,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:17,413 INFO L87 Difference]: Start difference. First operand 823 states and 1237 transitions. Second operand 4 states. [2018-12-08 18:01:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:17,657 INFO L93 Difference]: Finished difference Result 1715 states and 2579 transitions. [2018-12-08 18:01:17,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:17,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-08 18:01:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:17,658 INFO L225 Difference]: With dead ends: 1715 [2018-12-08 18:01:17,658 INFO L226 Difference]: Without dead ends: 917 [2018-12-08 18:01:17,659 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-12-08 18:01:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-08 18:01:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 825. [2018-12-08 18:01:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-08 18:01:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1239 transitions. [2018-12-08 18:01:17,696 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1239 transitions. Word has length 156 [2018-12-08 18:01:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:17,696 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1239 transitions. [2018-12-08 18:01:17,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1239 transitions. [2018-12-08 18:01:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 18:01:17,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:17,697 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-12-08 18:01:17,697 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:17,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1612541321, now seen corresponding path program 1 times [2018-12-08 18:01:17,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:17,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:17,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 18:01:17,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:17,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:17,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:17,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:17,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:17,743 INFO L87 Difference]: Start difference. First operand 825 states and 1239 transitions. Second operand 4 states. [2018-12-08 18:01:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:17,960 INFO L93 Difference]: Finished difference Result 1675 states and 2522 transitions. [2018-12-08 18:01:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:17,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-08 18:01:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:17,961 INFO L225 Difference]: With dead ends: 1675 [2018-12-08 18:01:17,961 INFO L226 Difference]: Without dead ends: 875 [2018-12-08 18:01:17,962 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-12-08 18:01:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2018-12-08 18:01:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 825. [2018-12-08 18:01:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-08 18:01:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1237 transitions. [2018-12-08 18:01:17,998 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1237 transitions. Word has length 156 [2018-12-08 18:01:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:17,998 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1237 transitions. [2018-12-08 18:01:17,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1237 transitions. [2018-12-08 18:01:17,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 18:01:17,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:17,999 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, 1, 1] [2018-12-08 18:01:17,999 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:17,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1834262860, now seen corresponding path program 1 times [2018-12-08 18:01:17,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:18,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:18,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:18,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:18,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:18,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:18,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:18,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:18,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:18,035 INFO L87 Difference]: Start difference. First operand 825 states and 1237 transitions. Second operand 4 states. [2018-12-08 18:01:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:18,395 INFO L93 Difference]: Finished difference Result 1727 states and 2587 transitions. [2018-12-08 18:01:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:18,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-08 18:01:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:18,396 INFO L225 Difference]: With dead ends: 1727 [2018-12-08 18:01:18,397 INFO L226 Difference]: Without dead ends: 927 [2018-12-08 18:01:18,397 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-12-08 18:01:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-08 18:01:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 825. [2018-12-08 18:01:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-08 18:01:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1235 transitions. [2018-12-08 18:01:18,436 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1235 transitions. Word has length 157 [2018-12-08 18:01:18,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:18,436 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1235 transitions. [2018-12-08 18:01:18,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1235 transitions. [2018-12-08 18:01:18,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 18:01:18,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:18,437 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, 1] [2018-12-08 18:01:18,437 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:18,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 654059408, now seen corresponding path program 1 times [2018-12-08 18:01:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:18,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:18,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:18,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:18,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:18,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:18,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:18,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:18,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:18,477 INFO L87 Difference]: Start difference. First operand 825 states and 1235 transitions. Second operand 4 states. [2018-12-08 18:01:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:18,848 INFO L93 Difference]: Finished difference Result 1705 states and 2555 transitions. [2018-12-08 18:01:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:18,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-08 18:01:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:18,850 INFO L225 Difference]: With dead ends: 1705 [2018-12-08 18:01:18,850 INFO L226 Difference]: Without dead ends: 905 [2018-12-08 18:01:18,851 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-12-08 18:01:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-08 18:01:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 827. [2018-12-08 18:01:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-12-08 18:01:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1237 transitions. [2018-12-08 18:01:18,898 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1237 transitions. Word has length 157 [2018-12-08 18:01:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:18,898 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1237 transitions. [2018-12-08 18:01:18,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1237 transitions. [2018-12-08 18:01:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 18:01:18,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:18,900 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, 1] [2018-12-08 18:01:18,900 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:18,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash 729986191, now seen corresponding path program 1 times [2018-12-08 18:01:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:18,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:18,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:18,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:18,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:18,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:18,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:18,962 INFO L87 Difference]: Start difference. First operand 827 states and 1237 transitions. Second operand 4 states. [2018-12-08 18:01:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:19,196 INFO L93 Difference]: Finished difference Result 1707 states and 2555 transitions. [2018-12-08 18:01:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:19,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-08 18:01:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:19,197 INFO L225 Difference]: With dead ends: 1707 [2018-12-08 18:01:19,197 INFO L226 Difference]: Without dead ends: 905 [2018-12-08 18:01:19,198 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-12-08 18:01:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-08 18:01:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 829. [2018-12-08 18:01:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-08 18:01:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1239 transitions. [2018-12-08 18:01:19,236 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1239 transitions. Word has length 157 [2018-12-08 18:01:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:19,236 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1239 transitions. [2018-12-08 18:01:19,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1239 transitions. [2018-12-08 18:01:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-08 18:01:19,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:19,237 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, 1] [2018-12-08 18:01:19,237 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:19,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1758171697, now seen corresponding path program 1 times [2018-12-08 18:01:19,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:19,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:19,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:19,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:19,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:19,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:19,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:19,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:19,272 INFO L87 Difference]: Start difference. First operand 829 states and 1239 transitions. Second operand 4 states. [2018-12-08 18:01:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:19,581 INFO L93 Difference]: Finished difference Result 1703 states and 2548 transitions. [2018-12-08 18:01:19,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:19,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-08 18:01:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:19,583 INFO L225 Difference]: With dead ends: 1703 [2018-12-08 18:01:19,583 INFO L226 Difference]: Without dead ends: 899 [2018-12-08 18:01:19,584 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-12-08 18:01:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-08 18:01:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 831. [2018-12-08 18:01:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-08 18:01:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1241 transitions. [2018-12-08 18:01:19,639 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1241 transitions. Word has length 158 [2018-12-08 18:01:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:19,639 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1241 transitions. [2018-12-08 18:01:19,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1241 transitions. [2018-12-08 18:01:19,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 18:01:19,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:19,640 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, 1, 1] [2018-12-08 18:01:19,640 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:19,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:19,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2095262753, now seen corresponding path program 1 times [2018-12-08 18:01:19,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:19,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:19,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:01:19,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:19,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:19,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:19,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:19,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:19,674 INFO L87 Difference]: Start difference. First operand 831 states and 1241 transitions. Second operand 4 states. [2018-12-08 18:01:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:19,929 INFO L93 Difference]: Finished difference Result 1733 states and 2583 transitions. [2018-12-08 18:01:19,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:19,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-08 18:01:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:19,930 INFO L225 Difference]: With dead ends: 1733 [2018-12-08 18:01:19,930 INFO L226 Difference]: Without dead ends: 927 [2018-12-08 18:01:19,931 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-12-08 18:01:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-08 18:01:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2018-12-08 18:01:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-08 18:01:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1239 transitions. [2018-12-08 18:01:19,972 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1239 transitions. Word has length 159 [2018-12-08 18:01:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:19,972 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1239 transitions. [2018-12-08 18:01:19,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1239 transitions. [2018-12-08 18:01:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 18:01:19,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:19,973 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, 1] [2018-12-08 18:01:19,973 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:19,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1068543879, now seen corresponding path program 1 times [2018-12-08 18:01:19,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:19,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:19,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:20,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:20,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:20,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:20,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:20,017 INFO L87 Difference]: Start difference. First operand 831 states and 1239 transitions. Second operand 4 states. [2018-12-08 18:01:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:20,257 INFO L93 Difference]: Finished difference Result 1705 states and 2544 transitions. [2018-12-08 18:01:20,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:20,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-08 18:01:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:20,258 INFO L225 Difference]: With dead ends: 1705 [2018-12-08 18:01:20,258 INFO L226 Difference]: Without dead ends: 899 [2018-12-08 18:01:20,259 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-12-08 18:01:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-08 18:01:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 833. [2018-12-08 18:01:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-12-08 18:01:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1241 transitions. [2018-12-08 18:01:20,298 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1241 transitions. Word has length 159 [2018-12-08 18:01:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:20,298 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1241 transitions. [2018-12-08 18:01:20,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1241 transitions. [2018-12-08 18:01:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 18:01:20,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:20,299 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, 1, 1] [2018-12-08 18:01:20,299 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:20,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1447175760, now seen corresponding path program 1 times [2018-12-08 18:01:20,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:20,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:20,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:20,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 18:01:20,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:20,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:20,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:20,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:20,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:20,333 INFO L87 Difference]: Start difference. First operand 833 states and 1241 transitions. Second operand 4 states. [2018-12-08 18:01:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:20,612 INFO L93 Difference]: Finished difference Result 1731 states and 2575 transitions. [2018-12-08 18:01:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:20,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-08 18:01:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:20,613 INFO L225 Difference]: With dead ends: 1731 [2018-12-08 18:01:20,614 INFO L226 Difference]: Without dead ends: 923 [2018-12-08 18:01:20,614 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-12-08 18:01:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-08 18:01:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 833. [2018-12-08 18:01:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-12-08 18:01:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1239 transitions. [2018-12-08 18:01:20,655 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1239 transitions. Word has length 160 [2018-12-08 18:01:20,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:20,655 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1239 transitions. [2018-12-08 18:01:20,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1239 transitions. [2018-12-08 18:01:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 18:01:20,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:20,656 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, 1, 1] [2018-12-08 18:01:20,656 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:20,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1152588609, now seen corresponding path program 1 times [2018-12-08 18:01:20,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:20,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:20,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:20,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:20,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:20,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:20,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:20,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:20,692 INFO L87 Difference]: Start difference. First operand 833 states and 1239 transitions. Second operand 4 states. [2018-12-08 18:01:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:20,942 INFO L93 Difference]: Finished difference Result 1725 states and 2563 transitions. [2018-12-08 18:01:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:20,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-08 18:01:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:20,942 INFO L225 Difference]: With dead ends: 1725 [2018-12-08 18:01:20,943 INFO L226 Difference]: Without dead ends: 917 [2018-12-08 18:01:20,943 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-12-08 18:01:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-08 18:01:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 833. [2018-12-08 18:01:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-12-08 18:01:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1237 transitions. [2018-12-08 18:01:20,985 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1237 transitions. Word has length 160 [2018-12-08 18:01:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:20,985 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1237 transitions. [2018-12-08 18:01:20,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1237 transitions. [2018-12-08 18:01:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 18:01:20,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:20,986 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, 1] [2018-12-08 18:01:20,986 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:20,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:20,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1759648439, now seen corresponding path program 1 times [2018-12-08 18:01:20,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:20,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:20,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 18:01:21,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:21,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:21,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:21,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:21,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:21,019 INFO L87 Difference]: Start difference. First operand 833 states and 1237 transitions. Second operand 4 states. [2018-12-08 18:01:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:21,274 INFO L93 Difference]: Finished difference Result 1701 states and 2529 transitions. [2018-12-08 18:01:21,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:21,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-08 18:01:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:21,275 INFO L225 Difference]: With dead ends: 1701 [2018-12-08 18:01:21,275 INFO L226 Difference]: Without dead ends: 893 [2018-12-08 18:01:21,275 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-12-08 18:01:21,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-08 18:01:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 835. [2018-12-08 18:01:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-12-08 18:01:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1239 transitions. [2018-12-08 18:01:21,318 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1239 transitions. Word has length 160 [2018-12-08 18:01:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1239 transitions. [2018-12-08 18:01:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1239 transitions. [2018-12-08 18:01:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-08 18:01:21,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:21,319 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, 1, 1, 1] [2018-12-08 18:01:21,319 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:21,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash -545265012, now seen corresponding path program 1 times [2018-12-08 18:01:21,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:21,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:21,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:21,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:21,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:21,356 INFO L87 Difference]: Start difference. First operand 835 states and 1239 transitions. Second operand 4 states. [2018-12-08 18:01:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:21,630 INFO L93 Difference]: Finished difference Result 1727 states and 2559 transitions. [2018-12-08 18:01:21,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:21,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-08 18:01:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:21,631 INFO L225 Difference]: With dead ends: 1727 [2018-12-08 18:01:21,631 INFO L226 Difference]: Without dead ends: 917 [2018-12-08 18:01:21,632 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-12-08 18:01:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-08 18:01:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 835. [2018-12-08 18:01:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-12-08 18:01:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1237 transitions. [2018-12-08 18:01:21,678 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1237 transitions. Word has length 163 [2018-12-08 18:01:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:21,678 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1237 transitions. [2018-12-08 18:01:21,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1237 transitions. [2018-12-08 18:01:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-08 18:01:21,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:21,680 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-12-08 18:01:21,680 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:21,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 162565545, now seen corresponding path program 1 times [2018-12-08 18:01:21,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:21,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:21,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:21,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:21,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:21,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:21,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:21,721 INFO L87 Difference]: Start difference. First operand 835 states and 1237 transitions. Second operand 4 states. [2018-12-08 18:01:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:21,983 INFO L93 Difference]: Finished difference Result 1779 states and 2654 transitions. [2018-12-08 18:01:21,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:21,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-08 18:01:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:21,985 INFO L225 Difference]: With dead ends: 1779 [2018-12-08 18:01:21,985 INFO L226 Difference]: Without dead ends: 969 [2018-12-08 18:01:21,986 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-12-08 18:01:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-12-08 18:01:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 895. [2018-12-08 18:01:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-08 18:01:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1343 transitions. [2018-12-08 18:01:22,036 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1343 transitions. Word has length 163 [2018-12-08 18:01:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:22,036 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1343 transitions. [2018-12-08 18:01:22,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1343 transitions. [2018-12-08 18:01:22,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 18:01:22,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:22,037 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, 1, 1, 1] [2018-12-08 18:01:22,037 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:22,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1934911766, now seen corresponding path program 1 times [2018-12-08 18:01:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:22,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:22,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:22,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:22,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:22,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:22,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:22,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:22,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:22,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:22,074 INFO L87 Difference]: Start difference. First operand 895 states and 1343 transitions. Second operand 4 states. [2018-12-08 18:01:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:22,314 INFO L93 Difference]: Finished difference Result 1835 states and 2751 transitions. [2018-12-08 18:01:22,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:22,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-08 18:01:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:22,315 INFO L225 Difference]: With dead ends: 1835 [2018-12-08 18:01:22,315 INFO L226 Difference]: Without dead ends: 965 [2018-12-08 18:01:22,316 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-12-08 18:01:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-12-08 18:01:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2018-12-08 18:01:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-08 18:01:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1341 transitions. [2018-12-08 18:01:22,359 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1341 transitions. Word has length 164 [2018-12-08 18:01:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:22,359 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1341 transitions. [2018-12-08 18:01:22,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1341 transitions. [2018-12-08 18:01:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 18:01:22,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:22,360 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, 1, 1, 1] [2018-12-08 18:01:22,360 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:22,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2010838549, now seen corresponding path program 1 times [2018-12-08 18:01:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:22,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:22,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:22,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:22,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:22,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:22,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:22,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:22,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:22,405 INFO L87 Difference]: Start difference. First operand 895 states and 1341 transitions. Second operand 4 states. [2018-12-08 18:01:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:22,633 INFO L93 Difference]: Finished difference Result 1835 states and 2747 transitions. [2018-12-08 18:01:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:22,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-08 18:01:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:22,634 INFO L225 Difference]: With dead ends: 1835 [2018-12-08 18:01:22,634 INFO L226 Difference]: Without dead ends: 965 [2018-12-08 18:01:22,635 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-12-08 18:01:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-12-08 18:01:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2018-12-08 18:01:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-08 18:01:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1339 transitions. [2018-12-08 18:01:22,679 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1339 transitions. Word has length 164 [2018-12-08 18:01:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:22,679 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1339 transitions. [2018-12-08 18:01:22,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1339 transitions. [2018-12-08 18:01:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 18:01:22,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:22,680 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, 1, 1, 1] [2018-12-08 18:01:22,680 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:22,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1485078165, now seen corresponding path program 1 times [2018-12-08 18:01:22,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:22,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:22,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:22,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:22,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:22,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:22,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:22,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:22,729 INFO L87 Difference]: Start difference. First operand 895 states and 1339 transitions. Second operand 4 states. [2018-12-08 18:01:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:22,975 INFO L93 Difference]: Finished difference Result 1829 states and 2736 transitions. [2018-12-08 18:01:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:22,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-08 18:01:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:22,976 INFO L225 Difference]: With dead ends: 1829 [2018-12-08 18:01:22,976 INFO L226 Difference]: Without dead ends: 959 [2018-12-08 18:01:22,978 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-12-08 18:01:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-08 18:01:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2018-12-08 18:01:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-08 18:01:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1337 transitions. [2018-12-08 18:01:23,023 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1337 transitions. Word has length 165 [2018-12-08 18:01:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:23,023 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1337 transitions. [2018-12-08 18:01:23,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1337 transitions. [2018-12-08 18:01:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-08 18:01:23,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:23,025 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, 1, 1, 1] [2018-12-08 18:01:23,025 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:23,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash -687954035, now seen corresponding path program 1 times [2018-12-08 18:01:23,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:23,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:23,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:23,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:23,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:23,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:23,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:23,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:23,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:23,069 INFO L87 Difference]: Start difference. First operand 895 states and 1337 transitions. Second operand 4 states. [2018-12-08 18:01:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:23,409 INFO L93 Difference]: Finished difference Result 1829 states and 2732 transitions. [2018-12-08 18:01:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:23,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-08 18:01:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:23,411 INFO L225 Difference]: With dead ends: 1829 [2018-12-08 18:01:23,411 INFO L226 Difference]: Without dead ends: 959 [2018-12-08 18:01:23,412 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-12-08 18:01:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-08 18:01:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2018-12-08 18:01:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-08 18:01:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1335 transitions. [2018-12-08 18:01:23,469 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1335 transitions. Word has length 166 [2018-12-08 18:01:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:23,469 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1335 transitions. [2018-12-08 18:01:23,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1335 transitions. [2018-12-08 18:01:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-08 18:01:23,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:23,470 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-12-08 18:01:23,470 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:23,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:23,470 INFO L82 PathProgramCache]: Analyzing trace with hash 462521418, now seen corresponding path program 1 times [2018-12-08 18:01:23,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:23,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:23,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:23,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-08 18:01:23,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:23,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:23,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:23,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:23,505 INFO L87 Difference]: Start difference. First operand 895 states and 1335 transitions. Second operand 4 states. [2018-12-08 18:01:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:23,751 INFO L93 Difference]: Finished difference Result 1823 states and 2721 transitions. [2018-12-08 18:01:23,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:23,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-08 18:01:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:23,752 INFO L225 Difference]: With dead ends: 1823 [2018-12-08 18:01:23,752 INFO L226 Difference]: Without dead ends: 953 [2018-12-08 18:01:23,753 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-12-08 18:01:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-08 18:01:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 895. [2018-12-08 18:01:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-08 18:01:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1333 transitions. [2018-12-08 18:01:23,798 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1333 transitions. Word has length 166 [2018-12-08 18:01:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:23,798 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1333 transitions. [2018-12-08 18:01:23,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1333 transitions. [2018-12-08 18:01:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-08 18:01:23,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:23,799 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-12-08 18:01:23,799 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:23,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash -241294597, now seen corresponding path program 1 times [2018-12-08 18:01:23,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:23,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:23,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:23,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:23,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-08 18:01:23,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:23,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:23,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:23,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:23,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:23,835 INFO L87 Difference]: Start difference. First operand 895 states and 1333 transitions. Second operand 4 states. [2018-12-08 18:01:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:24,128 INFO L93 Difference]: Finished difference Result 1845 states and 2746 transitions. [2018-12-08 18:01:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:24,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-08 18:01:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:24,129 INFO L225 Difference]: With dead ends: 1845 [2018-12-08 18:01:24,129 INFO L226 Difference]: Without dead ends: 975 [2018-12-08 18:01:24,130 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-12-08 18:01:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-08 18:01:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 895. [2018-12-08 18:01:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-12-08 18:01:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1331 transitions. [2018-12-08 18:01:24,176 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1331 transitions. Word has length 166 [2018-12-08 18:01:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:24,176 INFO L480 AbstractCegarLoop]: Abstraction has 895 states and 1331 transitions. [2018-12-08 18:01:24,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1331 transitions. [2018-12-08 18:01:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 18:01:24,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:24,177 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, 1, 1, 1] [2018-12-08 18:01:24,177 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:24,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash -376508925, now seen corresponding path program 1 times [2018-12-08 18:01:24,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:24,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:24,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:24,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:24,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:24,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:24,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:24,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:24,228 INFO L87 Difference]: Start difference. First operand 895 states and 1331 transitions. Second operand 4 states. [2018-12-08 18:01:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:24,468 INFO L93 Difference]: Finished difference Result 1823 states and 2713 transitions. [2018-12-08 18:01:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:24,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-08 18:01:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:24,469 INFO L225 Difference]: With dead ends: 1823 [2018-12-08 18:01:24,470 INFO L226 Difference]: Without dead ends: 953 [2018-12-08 18:01:24,470 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-12-08 18:01:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-08 18:01:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 879. [2018-12-08 18:01:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-08 18:01:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1311 transitions. [2018-12-08 18:01:24,516 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1311 transitions. Word has length 167 [2018-12-08 18:01:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:24,516 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1311 transitions. [2018-12-08 18:01:24,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1311 transitions. [2018-12-08 18:01:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-08 18:01:24,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:24,517 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-12-08 18:01:24,517 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:24,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:24,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1336504444, now seen corresponding path program 1 times [2018-12-08 18:01:24,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:24,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:24,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:24,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:24,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-08 18:01:24,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:24,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:24,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:24,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:24,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:24,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:24,562 INFO L87 Difference]: Start difference. First operand 879 states and 1311 transitions. Second operand 4 states. [2018-12-08 18:01:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:24,839 INFO L93 Difference]: Finished difference Result 1813 states and 2702 transitions. [2018-12-08 18:01:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:24,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-08 18:01:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:24,840 INFO L225 Difference]: With dead ends: 1813 [2018-12-08 18:01:24,840 INFO L226 Difference]: Without dead ends: 959 [2018-12-08 18:01:24,841 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-12-08 18:01:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-12-08 18:01:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 879. [2018-12-08 18:01:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-08 18:01:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1309 transitions. [2018-12-08 18:01:24,888 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1309 transitions. Word has length 167 [2018-12-08 18:01:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:24,888 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1309 transitions. [2018-12-08 18:01:24,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1309 transitions. [2018-12-08 18:01:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 18:01:24,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:24,889 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-12-08 18:01:24,889 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:24,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash -738395018, now seen corresponding path program 1 times [2018-12-08 18:01:24,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:24,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:24,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-08 18:01:24,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:24,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:24,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:24,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:24,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:24,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:24,932 INFO L87 Difference]: Start difference. First operand 879 states and 1309 transitions. Second operand 4 states. [2018-12-08 18:01:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:25,169 INFO L93 Difference]: Finished difference Result 1783 states and 2662 transitions. [2018-12-08 18:01:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:25,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-08 18:01:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:25,170 INFO L225 Difference]: With dead ends: 1783 [2018-12-08 18:01:25,170 INFO L226 Difference]: Without dead ends: 929 [2018-12-08 18:01:25,171 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-12-08 18:01:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-12-08 18:01:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 879. [2018-12-08 18:01:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-08 18:01:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1307 transitions. [2018-12-08 18:01:25,218 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1307 transitions. Word has length 168 [2018-12-08 18:01:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:25,219 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1307 transitions. [2018-12-08 18:01:25,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1307 transitions. [2018-12-08 18:01:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 18:01:25,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:25,219 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:01:25,220 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:25,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash -625046328, now seen corresponding path program 1 times [2018-12-08 18:01:25,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:25,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-08 18:01:25,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:25,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:25,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:25,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:25,260 INFO L87 Difference]: Start difference. First operand 879 states and 1307 transitions. Second operand 4 states. [2018-12-08 18:01:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:25,509 INFO L93 Difference]: Finished difference Result 1803 states and 2679 transitions. [2018-12-08 18:01:25,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:25,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-08 18:01:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:25,510 INFO L225 Difference]: With dead ends: 1803 [2018-12-08 18:01:25,510 INFO L226 Difference]: Without dead ends: 949 [2018-12-08 18:01:25,511 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-12-08 18:01:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-12-08 18:01:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 881. [2018-12-08 18:01:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-12-08 18:01:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1309 transitions. [2018-12-08 18:01:25,560 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1309 transitions. Word has length 169 [2018-12-08 18:01:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:25,560 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1309 transitions. [2018-12-08 18:01:25,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2018-12-08 18:01:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 18:01:25,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:25,561 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, 1, 1] [2018-12-08 18:01:25,561 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:25,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:25,561 INFO L82 PathProgramCache]: Analyzing trace with hash 610499713, now seen corresponding path program 1 times [2018-12-08 18:01:25,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:25,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:25,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:25,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-08 18:01:25,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:25,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:25,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:25,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:25,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:25,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:25,604 INFO L87 Difference]: Start difference. First operand 881 states and 1309 transitions. Second operand 4 states. [2018-12-08 18:01:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:25,819 INFO L93 Difference]: Finished difference Result 1765 states and 2630 transitions. [2018-12-08 18:01:25,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:25,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-08 18:01:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:25,820 INFO L225 Difference]: With dead ends: 1765 [2018-12-08 18:01:25,820 INFO L226 Difference]: Without dead ends: 909 [2018-12-08 18:01:25,821 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-12-08 18:01:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-08 18:01:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 881. [2018-12-08 18:01:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-12-08 18:01:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1307 transitions. [2018-12-08 18:01:25,871 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1307 transitions. Word has length 169 [2018-12-08 18:01:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:25,871 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1307 transitions. [2018-12-08 18:01:25,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1307 transitions. [2018-12-08 18:01:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 18:01:25,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:25,872 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-12-08 18:01:25,872 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:25,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1461067407, now seen corresponding path program 1 times [2018-12-08 18:01:25,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:25,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:25,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-08 18:01:25,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:25,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:25,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:25,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:25,915 INFO L87 Difference]: Start difference. First operand 881 states and 1307 transitions. Second operand 4 states. [2018-12-08 18:01:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:26,221 INFO L93 Difference]: Finished difference Result 1783 states and 2654 transitions. [2018-12-08 18:01:26,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:26,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-08 18:01:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:26,222 INFO L225 Difference]: With dead ends: 1783 [2018-12-08 18:01:26,222 INFO L226 Difference]: Without dead ends: 927 [2018-12-08 18:01:26,223 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-12-08 18:01:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-08 18:01:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 881. [2018-12-08 18:01:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-12-08 18:01:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1305 transitions. [2018-12-08 18:01:26,273 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1305 transitions. Word has length 169 [2018-12-08 18:01:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:26,273 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 1305 transitions. [2018-12-08 18:01:26,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1305 transitions. [2018-12-08 18:01:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 18:01:26,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:26,274 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, 1] [2018-12-08 18:01:26,274 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:26,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1388667942, now seen corresponding path program 1 times [2018-12-08 18:01:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:26,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:26,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:26,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:01:26,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:26,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:01:26,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:01:26,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:01:26,353 INFO L87 Difference]: Start difference. First operand 881 states and 1305 transitions. Second operand 5 states. [2018-12-08 18:01:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:27,245 INFO L93 Difference]: Finished difference Result 1895 states and 2826 transitions. [2018-12-08 18:01:27,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 18:01:27,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-12-08 18:01:27,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:27,246 INFO L225 Difference]: With dead ends: 1895 [2018-12-08 18:01:27,246 INFO L226 Difference]: Without dead ends: 1039 [2018-12-08 18:01:27,247 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-12-08 18:01:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-12-08 18:01:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 947. [2018-12-08 18:01:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-12-08 18:01:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1423 transitions. [2018-12-08 18:01:27,301 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1423 transitions. Word has length 169 [2018-12-08 18:01:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:27,301 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1423 transitions. [2018-12-08 18:01:27,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:01:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1423 transitions. [2018-12-08 18:01:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 18:01:27,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:27,302 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, 1, 1] [2018-12-08 18:01:27,302 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:27,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2101277887, now seen corresponding path program 1 times [2018-12-08 18:01:27,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:27,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:27,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:27,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:27,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 18:01:27,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:27,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:27,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:27,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:27,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:27,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:27,340 INFO L87 Difference]: Start difference. First operand 947 states and 1423 transitions. Second operand 4 states. [2018-12-08 18:01:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:27,582 INFO L93 Difference]: Finished difference Result 1941 states and 2911 transitions. [2018-12-08 18:01:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:27,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-12-08 18:01:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:27,583 INFO L225 Difference]: With dead ends: 1941 [2018-12-08 18:01:27,584 INFO L226 Difference]: Without dead ends: 1019 [2018-12-08 18:01:27,584 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-12-08 18:01:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-12-08 18:01:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 947. [2018-12-08 18:01:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2018-12-08 18:01:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1421 transitions. [2018-12-08 18:01:27,635 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1421 transitions. Word has length 175 [2018-12-08 18:01:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:27,635 INFO L480 AbstractCegarLoop]: Abstraction has 947 states and 1421 transitions. [2018-12-08 18:01:27,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1421 transitions. [2018-12-08 18:01:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 18:01:27,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:27,636 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, 1, 1] [2018-12-08 18:01:27,636 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:27,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2142063282, now seen corresponding path program 1 times [2018-12-08 18:01:27,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:27,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 18:01:27,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:27,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:27,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:27,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:27,674 INFO L87 Difference]: Start difference. First operand 947 states and 1421 transitions. Second operand 4 states. [2018-12-08 18:01:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:27,938 INFO L93 Difference]: Finished difference Result 1937 states and 2903 transitions. [2018-12-08 18:01:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:27,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-12-08 18:01:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:27,939 INFO L225 Difference]: With dead ends: 1937 [2018-12-08 18:01:27,939 INFO L226 Difference]: Without dead ends: 1015 [2018-12-08 18:01:27,940 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-12-08 18:01:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-12-08 18:01:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 885. [2018-12-08 18:01:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-08 18:01:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1327 transitions. [2018-12-08 18:01:27,991 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1327 transitions. Word has length 176 [2018-12-08 18:01:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:27,991 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1327 transitions. [2018-12-08 18:01:27,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1327 transitions. [2018-12-08 18:01:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 18:01:27,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:27,992 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, 1, 1] [2018-12-08 18:01:27,992 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:27,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -906517241, now seen corresponding path program 1 times [2018-12-08 18:01:27,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:27,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:28,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:01:28,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 18:01:28,284 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-12-08 18:01:28,286 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [114], [119], [124], [129], [134], [139], [144], [149], [154], [159], [164], [169], [174], [179], [184], [187], [189], [194], [197], [199], [204], [207], [278], [281], [289], [291], [294], [302], [305], [309], [514], [519], [524], [529], [544], [549], [554], [559], [564], [570], [575], [577], [582], [587], [592], [598], [601], [605], [626], [660], [662], [674], [677], [678], [679], [681] [2018-12-08 18:01:28,310 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 18:01:28,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 18:01:28,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 18:01:28,734 INFO L272 AbstractInterpreter]: Visited 82 different actions 278 times. Merged at 67 different actions 187 times. Never widened. Performed 1965 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1965 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 118 variables. [2018-12-08 18:01:28,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:28,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 18:01:28,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:01:28,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/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-12-08 18:01:28,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:28,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 18:01:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:28,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 18:01:28,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-08 18:01:28,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,912 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-12-08 18:01:28,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,934 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-12-08 18:01:28,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:28,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:28,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:28,968 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-12-08 18:01:28,970 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-12-08 18:01:28,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,974 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-12-08 18:01:28,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:28,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, 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-12-08 18:01:28,980 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:28,989 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:28,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:28,999 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,009 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-12-08 18:01:29,010 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-08 18:01:29,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,070 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-12-08 18:01:29,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,084 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-12-08 18:01:29,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,124 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-12-08 18:01:29,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,133 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-12-08 18:01:29,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,148 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-12-08 18:01:29,149 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,166 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,180 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-08 18:01:29,198 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-12-08 18:01:29,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,205 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-12-08 18:01:29,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:29,229 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-12-08 18:01:29,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,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, 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-12-08 18:01:29,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:29,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,284 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-12-08 18:01:29,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,294 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-12-08 18:01:29,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,315 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-12-08 18:01:29,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,367 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:01:29,373 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-12-08 18:01:29,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,381 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-12-08 18:01:29,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:29,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, 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-12-08 18:01:29,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,413 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-12-08 18:01:29,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:29,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 49 treesize of output 45 [2018-12-08 18:01:29,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,440 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-08 18:01:29,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 113 [2018-12-08 18:01:29,466 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 27 [2018-12-08 18:01:29,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,486 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-08 18:01:29,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-08 18:01:29,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,545 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 100 treesize of output 154 [2018-12-08 18:01:29,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-08 18:01:29,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,599 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 100 treesize of output 154 [2018-12-08 18:01:29,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-08 18:01:29,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, 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-12-08 18:01:29,661 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-12-08 18:01:29,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-08 18:01:29,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,704 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 100 treesize of output 154 [2018-12-08 18:01:29,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-08 18:01:29,756 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-12-08 18:01:29,758 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 29 treesize of output 25 [2018-12-08 18:01:29,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 107 [2018-12-08 18:01:29,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 11 treesize of output 1 [2018-12-08 18:01:29,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,793 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 82 treesize of output 62 [2018-12-08 18:01:29,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,811 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 23 treesize of output 24 [2018-12-08 18:01:29,812 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-12-08 18:01:29,813 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,820 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-08 18:01:29,841 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 32 treesize of output 31 [2018-12-08 18:01:29,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,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, 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-12-08 18:01:29,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:29,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-08 18:01:29,896 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-12-08 18:01:29,899 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-12-08 18:01:29,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:29,906 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-12-08 18:01:29,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:29,915 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-08 18:01:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 18:01:30,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 18:01:30,133 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 36 [2018-12-08 18:01:30,134 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 36 treesize of output 32 [2018-12-08 18:01:30,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-08 18:01:30,248 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,256 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 62 treesize of output 54 [2018-12-08 18:01:30,270 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 11 treesize of output 10 [2018-12-08 18:01:30,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:30,276 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 10 treesize of output 8 [2018-12-08 18:01:30,278 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 8 treesize of output 1 [2018-12-08 18:01:30,278 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:30,279 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:30,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:30,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,284 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-08 18:01:30,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-08 18:01:30,318 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 56 treesize of output 52 [2018-12-08 18:01:30,320 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:30,321 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2018-12-08 18:01:30,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-12-08 18:01:30,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,389 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,394 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:30,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 18:01:30,408 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-08 18:01:32,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:32,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:32,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:32,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:32,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 18:01:32,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-08 18:01:35,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,154 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,174 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,177 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-08 18:01:35,182 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:144, output treesize:83 [2018-12-08 18:01:35,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,397 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:35,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 18:01:35,424 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-08 18:01:37,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,535 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,567 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,568 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:37,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 18:01:37,576 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-08 18:01:39,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-12-08 18:01:39,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,848 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,859 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,860 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,870 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,977 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,985 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:39,995 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,002 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,012 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,022 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,075 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,079 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,119 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,124 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,125 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,131 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,132 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,137 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,176 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,178 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:40,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-08 18:01:40,188 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 9 variables, input treesize:184, output treesize:103 [2018-12-08 18:01:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 28 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 18:01:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 18:01:40,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-12-08 18:01:40,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 18:01:40,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 18:01:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 18:01:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2018-12-08 18:01:40,362 INFO L87 Difference]: Start difference. First operand 885 states and 1327 transitions. Second operand 18 states. [2018-12-08 18:01:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:43,812 INFO L93 Difference]: Finished difference Result 2423 states and 3615 transitions. [2018-12-08 18:01:43,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 18:01:43,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 176 [2018-12-08 18:01:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:43,816 INFO L225 Difference]: With dead ends: 2423 [2018-12-08 18:01:43,816 INFO L226 Difference]: Without dead ends: 1563 [2018-12-08 18:01:43,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 333 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=220, Invalid=1039, Unknown=1, NotChecked=0, Total=1260 [2018-12-08 18:01:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-12-08 18:01:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 845. [2018-12-08 18:01:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-08 18:01:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1249 transitions. [2018-12-08 18:01:43,910 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1249 transitions. Word has length 176 [2018-12-08 18:01:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:43,911 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1249 transitions. [2018-12-08 18:01:43,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 18:01:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1249 transitions. [2018-12-08 18:01:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 18:01:43,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:43,912 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-12-08 18:01:43,912 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:43,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash 326812478, now seen corresponding path program 1 times [2018-12-08 18:01:43,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:43,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:43,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:43,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:43,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:43,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:43,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:43,960 INFO L87 Difference]: Start difference. First operand 845 states and 1249 transitions. Second operand 4 states. [2018-12-08 18:01:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:44,293 INFO L93 Difference]: Finished difference Result 1739 states and 2570 transitions. [2018-12-08 18:01:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:44,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-08 18:01:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:44,294 INFO L225 Difference]: With dead ends: 1739 [2018-12-08 18:01:44,295 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:01:44,295 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-12-08 18:01:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:01:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 845. [2018-12-08 18:01:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-08 18:01:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1247 transitions. [2018-12-08 18:01:44,357 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1247 transitions. Word has length 178 [2018-12-08 18:01:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:44,357 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1247 transitions. [2018-12-08 18:01:44,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1247 transitions. [2018-12-08 18:01:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 18:01:44,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:44,358 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-12-08 18:01:44,358 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:44,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1767954585, now seen corresponding path program 1 times [2018-12-08 18:01:44,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:44,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:44,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:44,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:44,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:44,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:44,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:44,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:44,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:44,402 INFO L87 Difference]: Start difference. First operand 845 states and 1247 transitions. Second operand 4 states. [2018-12-08 18:01:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:44,740 INFO L93 Difference]: Finished difference Result 1739 states and 2566 transitions. [2018-12-08 18:01:44,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:44,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-08 18:01:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:44,741 INFO L225 Difference]: With dead ends: 1739 [2018-12-08 18:01:44,742 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:01:44,742 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-12-08 18:01:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:01:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 845. [2018-12-08 18:01:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-08 18:01:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1245 transitions. [2018-12-08 18:01:44,808 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1245 transitions. Word has length 179 [2018-12-08 18:01:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:44,808 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1245 transitions. [2018-12-08 18:01:44,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1245 transitions. [2018-12-08 18:01:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-08 18:01:44,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:44,809 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-12-08 18:01:44,809 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:44,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:44,809 INFO L82 PathProgramCache]: Analyzing trace with hash -248342535, now seen corresponding path program 1 times [2018-12-08 18:01:44,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:44,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:44,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:44,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:44,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:44,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:44,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:44,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:44,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:44,856 INFO L87 Difference]: Start difference. First operand 845 states and 1245 transitions. Second operand 4 states. [2018-12-08 18:01:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:45,151 INFO L93 Difference]: Finished difference Result 1739 states and 2562 transitions. [2018-12-08 18:01:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:45,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-08 18:01:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:45,153 INFO L225 Difference]: With dead ends: 1739 [2018-12-08 18:01:45,153 INFO L226 Difference]: Without dead ends: 919 [2018-12-08 18:01:45,153 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-12-08 18:01:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-08 18:01:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 845. [2018-12-08 18:01:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-08 18:01:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1243 transitions. [2018-12-08 18:01:45,213 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1243 transitions. Word has length 180 [2018-12-08 18:01:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:45,213 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1243 transitions. [2018-12-08 18:01:45,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1243 transitions. [2018-12-08 18:01:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-08 18:01:45,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:45,214 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-12-08 18:01:45,214 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:45,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2071073292, now seen corresponding path program 1 times [2018-12-08 18:01:45,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:45,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:45,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:45,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:45,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:45,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:45,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:01:45,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:45,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:01:45,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:01:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:01:45,273 INFO L87 Difference]: Start difference. First operand 845 states and 1243 transitions. Second operand 4 states. [2018-12-08 18:01:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:45,577 INFO L93 Difference]: Finished difference Result 1719 states and 2534 transitions. [2018-12-08 18:01:45,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:45,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-12-08 18:01:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:45,578 INFO L225 Difference]: With dead ends: 1719 [2018-12-08 18:01:45,578 INFO L226 Difference]: Without dead ends: 899 [2018-12-08 18:01:45,579 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-12-08 18:01:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-08 18:01:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 845. [2018-12-08 18:01:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-08 18:01:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1241 transitions. [2018-12-08 18:01:45,638 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1241 transitions. Word has length 181 [2018-12-08 18:01:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:45,638 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1241 transitions. [2018-12-08 18:01:45,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:01:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1241 transitions. [2018-12-08 18:01:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-08 18:01:45,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:45,639 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-12-08 18:01:45,639 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:45,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash 328762145, now seen corresponding path program 1 times [2018-12-08 18:01:45,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:45,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:45,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:45,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:45,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-08 18:01:45,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:45,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:01:45,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:45,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:01:45,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:01:45,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:01:45,719 INFO L87 Difference]: Start difference. First operand 845 states and 1241 transitions. Second operand 5 states. [2018-12-08 18:01:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:46,093 INFO L93 Difference]: Finished difference Result 1975 states and 2944 transitions. [2018-12-08 18:01:46,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:46,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-12-08 18:01:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:46,095 INFO L225 Difference]: With dead ends: 1975 [2018-12-08 18:01:46,095 INFO L226 Difference]: Without dead ends: 1155 [2018-12-08 18:01:46,096 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-12-08 18:01:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-12-08 18:01:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 923. [2018-12-08 18:01:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-12-08 18:01:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1383 transitions. [2018-12-08 18:01:46,174 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1383 transitions. Word has length 184 [2018-12-08 18:01:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:46,174 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1383 transitions. [2018-12-08 18:01:46,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:01:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1383 transitions. [2018-12-08 18:01:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-08 18:01:46,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:46,175 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, 1] [2018-12-08 18:01:46,175 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:46,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1551695247, now seen corresponding path program 1 times [2018-12-08 18:01:46,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:46,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:46,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-08 18:01:46,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:01:46,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:01:46,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:01:46,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:01:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:01:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:01:46,239 INFO L87 Difference]: Start difference. First operand 923 states and 1383 transitions. Second operand 5 states. [2018-12-08 18:01:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:46,589 INFO L93 Difference]: Finished difference Result 2043 states and 3080 transitions. [2018-12-08 18:01:46,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:01:46,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-08 18:01:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:46,590 INFO L225 Difference]: With dead ends: 2043 [2018-12-08 18:01:46,590 INFO L226 Difference]: Without dead ends: 1145 [2018-12-08 18:01:46,591 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-12-08 18:01:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-12-08 18:01:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 977. [2018-12-08 18:01:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-12-08 18:01:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1493 transitions. [2018-12-08 18:01:46,654 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1493 transitions. Word has length 185 [2018-12-08 18:01:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:46,654 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1493 transitions. [2018-12-08 18:01:46,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:01:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1493 transitions. [2018-12-08 18:01:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-08 18:01:46,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:46,655 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, 1] [2018-12-08 18:01:46,655 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:46,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:46,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1844882177, now seen corresponding path program 1 times [2018-12-08 18:01:46,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:46,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:46,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:46,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:47,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:01:47,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 18:01:47,024 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-12-08 18:01:47,024 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [329], [331], [336], [338], [343], [348], [389], [391], [393], [396], [407], [409], [419], [421], [426], [432], [454], [456], [514], [519], [524], [529], [626], [660], [662], [674], [677], [678], [679], [681] [2018-12-08 18:01:47,027 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 18:01:47,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 18:01:47,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 18:01:47,234 INFO L272 AbstractInterpreter]: Visited 86 different actions 231 times. Merged at 69 different actions 135 times. Never widened. Performed 1663 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1663 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 137 variables. [2018-12-08 18:01:47,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:47,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 18:01:47,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 18:01:47,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/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-12-08 18:01:47,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:47,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 18:01:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:01:47,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 18:01:47,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,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, 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-12-08 18:01:47,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,386 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-12-08 18:01:47,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,407 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-12-08 18:01:47,407 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,436 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-12-08 18:01:47,437 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-12-08 18:01:47,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,439 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-12-08 18:01:47,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,444 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-12-08 18:01:47,444 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,454 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,465 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-12-08 18:01:47,465 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-08 18:01:47,498 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-12-08 18:01:47,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,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-12-08 18:01:47,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,539 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-12-08 18:01:47,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,546 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-12-08 18:01:47,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,570 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-12-08 18:01:47,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,576 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-12-08 18:01:47,576 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,589 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,595 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-08 18:01:47,613 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-12-08 18:01:47,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,620 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-12-08 18:01:47,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:47,644 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-12-08 18:01:47,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,650 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-12-08 18:01:47,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:47,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:47,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:47,684 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-12-08 18:01:47,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,691 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-12-08 18:01:47,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,704 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-12-08 18:01:47,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,737 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:01:47,742 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-12-08 18:01:47,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,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 77 treesize of output 127 [2018-12-08 18:01:47,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:47,771 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-12-08 18:01:47,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,778 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-12-08 18:01:47,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-08 18:01:47,808 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-12-08 18:01:47,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,817 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-12-08 18:01:47,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,847 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-12-08 18:01:47,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,855 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-12-08 18:01:47,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:01:47,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 49 treesize of output 45 [2018-12-08 18:01:47,884 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-12-08 18:01:47,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:47,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:47,903 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 116 treesize of output 110 [2018-12-08 18:01:47,904 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-12-08 18:01:47,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-08 18:01:47,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:47,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-08 18:01:47,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,941 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-12-08 18:01:47,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:47,954 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-12-08 18:01:47,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:47,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,000 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-08 18:01:48,005 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-12-08 18:01:48,007 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-12-08 18:01:48,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,029 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 116 treesize of output 110 [2018-12-08 18:01:48,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 28 treesize of output 1 [2018-12-08 18:01:48,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-08 18:01:48,066 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-12-08 18:01:48,071 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-12-08 18:01:48,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,105 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-12-08 18:01:48,110 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-12-08 18:01:48,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,141 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-12-08 18:01:48,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,149 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-12-08 18:01:48,149 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,167 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,236 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,239 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,280 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,293 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,346 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 226 treesize of output 227 [2018-12-08 18:01:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 1 [2018-12-08 18:01:48,350 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,363 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 182 [2018-12-08 18:01:48,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,436 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 157 treesize of output 232 [2018-12-08 18:01:48,436 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,470 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 153 [2018-12-08 18:01:48,472 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-12-08 18:01:48,472 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,495 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 149 treesize of output 125 [2018-12-08 18:01:48,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,509 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 122 treesize of output 210 [2018-12-08 18:01:48,509 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,533 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,545 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,558 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,577 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 62 treesize of output 55 [2018-12-08 18:01:48,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,580 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 55 treesize of output 51 [2018-12-08 18:01:48,581 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,586 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,600 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-08 18:01:48,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 53 treesize of output 49 [2018-12-08 18:01:48,632 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-12-08 18:01:48,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,651 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 119 treesize of output 97 [2018-12-08 18:01:48,653 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 97 treesize of output 77 [2018-12-08 18:01:48,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,670 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 47 treesize of output 58 [2018-12-08 18:01:48,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:48,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01: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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-08 18:01:48,674 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:48,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,686 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-08 18:01:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:48,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 18:01:48,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:48,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,018 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,040 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,043 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:49,059 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 282 treesize of output 273 [2018-12-08 18:01:49,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 18:01:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 245 [2018-12-08 18:01:49,064 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,069 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,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 198 treesize of output 196 [2018-12-08 18:01:49,080 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 191 treesize of output 187 [2018-12-08 18:01:49,080 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,083 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,089 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 187 treesize of output 159 [2018-12-08 18:01:49,091 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 11 treesize of output 10 [2018-12-08 18:01:49,091 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,099 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 0 case distinctions, treesize of input 158 treesize of output 129 [2018-12-08 18:01:49,111 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,112 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,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 31 treesize of output 70 [2018-12-08 18:01:49,112 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,130 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 121 treesize of output 112 [2018-12-08 18:01:49,132 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,132 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,132 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,133 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,133 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,133 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,134 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 30 treesize of output 27 [2018-12-08 18:01:49,134 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,149 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 107 treesize of output 99 [2018-12-08 18:01:49,149 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,162 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,162 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,162 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 99 treesize of output 90 [2018-12-08 18:01:49,163 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,172 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 18:01:49,175 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 182 treesize of output 168 [2018-12-08 18:01:49,176 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 8 treesize of output 1 [2018-12-08 18:01:49,177 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,183 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,183 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 18:01:49,184 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 17 treesize of output 7 [2018-12-08 18:01:49,184 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,187 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 18:01:49,194 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 18:01:49,199 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 18:01:49,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 18:01:49,207 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:109 [2018-12-08 18:01:49,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,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 273 treesize of output 259 [2018-12-08 18:01:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 231 [2018-12-08 18:01:49,240 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:49,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:143, output treesize:231 [2018-12-08 18:01:50,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,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-12-08 18:01:50,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:133, output treesize:97 [2018-12-08 18:01:50,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 259 [2018-12-08 18:01:50,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 231 [2018-12-08 18:01:50,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:143, output treesize:231 [2018-12-08 18:01:50,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:133, output treesize:97 [2018-12-08 18:01:50,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:87 [2018-12-08 18:01:50,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:77 [2018-12-08 18:01:50,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:133, output treesize:112 [2018-12-08 18:01:50,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:87 [2018-12-08 18:01:50,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:87 [2018-12-08 18:01:50,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,653 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,655 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 18:01:50,658 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:153, output treesize:112 [2018-12-08 18:01:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-08 18:01:50,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 18:01:50,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 23 [2018-12-08 18:01:50,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 18:01:50,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 18:01:50,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 18:01:50,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-12-08 18:01:50,876 INFO L87 Difference]: Start difference. First operand 977 states and 1493 transitions. Second operand 16 states. [2018-12-08 18:01:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:01:54,945 INFO L93 Difference]: Finished difference Result 3379 states and 5144 transitions. [2018-12-08 18:01:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 18:01:54,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 198 [2018-12-08 18:01:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:01:54,949 INFO L225 Difference]: With dead ends: 3379 [2018-12-08 18:01:54,949 INFO L226 Difference]: Without dead ends: 2427 [2018-12-08 18:01:54,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 373 SyntacticMatches, 23 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 18:01:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2018-12-08 18:01:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1439. [2018-12-08 18:01:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-12-08 18:01:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2283 transitions. [2018-12-08 18:01:55,041 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2283 transitions. Word has length 198 [2018-12-08 18:01:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:01:55,041 INFO L480 AbstractCegarLoop]: Abstraction has 1439 states and 2283 transitions. [2018-12-08 18:01:55,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 18:01:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2283 transitions. [2018-12-08 18:01:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-08 18:01:55,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:01:55,042 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-08 18:01:55,043 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:01:55,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:01:55,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1027478594, now seen corresponding path program 1 times [2018-12-08 18:01:55,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:01:55,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:55,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:01:55,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:01:55,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:01:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 18:01:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 18:01:55,152 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 18:01:55,193 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24591 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-12-08 18:01:55,194 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24589 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-12-08 18:01:55,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 06:01:55 BoogieIcfgContainer [2018-12-08 18:01:55,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 18:01:55,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 18:01:55,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 18:01:55,248 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 18:01:55,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:00:56" (3/4) ... [2018-12-08 18:01:55,252 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 18:01:55,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 18:01:55,252 INFO L168 Benchmark]: Toolchain (without parser) took 59876.93 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 549.5 MB). Free memory was 947.0 MB in the beginning and 819.0 MB in the end (delta: 128.0 MB). Peak memory consumption was 677.4 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:55,253 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:01:55,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:55,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:55,254 INFO L168 Benchmark]: Boogie Preprocessor took 45.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:55,254 INFO L168 Benchmark]: RCFGBuilder took 593.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 87.9 MB). Peak memory consumption was 87.9 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:55,254 INFO L168 Benchmark]: TraceAbstraction took 58855.07 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 445.1 MB). Free memory was 984.9 MB in the beginning and 819.0 MB in the end (delta: 165.9 MB). Peak memory consumption was 611.0 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:55,255 INFO L168 Benchmark]: Witness Printer took 4.22 ms. Allocated memory is still 1.6 GB. Free memory is still 819.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:01:55,256 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.99 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 593.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 87.9 MB). Peak memory consumption was 87.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58855.07 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 445.1 MB). Free memory was 984.9 MB in the beginning and 819.0 MB in the end (delta: 165.9 MB). Peak memory consumption was 611.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.22 ms. Allocated memory is still 1.6 GB. Free memory is still 819.0 MB. 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 24591 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 24589 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: 1762]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24610, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24590: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))={24597:0}, malloc(sizeof(SSL_CTX))={24612:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24602:0}, s={24597:0}, SSLv3_server_data={24590:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24597:0}, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1598] EXPR s->session [L1598] EXPR s->s3 [L1598] EXPR (s->s3)->tmp.new_cipher [L1598] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1599] COND FALSE !(! tmp___9) [L1605] ret = __VERIFIER_nondet_int() [L1606] COND FALSE !(blastFlag == 10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1609] COND FALSE !(blastFlag == 13) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1612] COND FALSE !(blastFlag == 16) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1619] COND FALSE !(ret <= 0) [L1624] s->state = 8672 [L1625] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1626] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1635] ret = __VERIFIER_nondet_int() [L1636] COND FALSE !(blastFlag == 11) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1639] COND FALSE !(blastFlag == 14) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1642] COND FALSE !(blastFlag == 17) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1649] COND FALSE !(ret <= 0) [L1654] s->state = 8448 [L1655] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1655] COND TRUE s->hit [L1656] EXPR s->s3 [L1656] (s->s3)->tmp.next_state = 8640 [L1660] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24580, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1574] COND FALSE !(blastFlag == 12) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1577] COND FALSE !(blastFlag == 15) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1762] __VERIFIER_error() VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 1 error locations. UNSAFE Result, 58.8s OverallTime, 117 OverallIterations, 7 TraceHistogramMax, 33.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28134 SDtfs, 10128 SDslu, 46971 SDs, 0 SdLazy, 29228 SolverSat, 1524 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1530 GetRequests, 934 SyntacticMatches, 186 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1439occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 116 MinimizatonAttempts, 8962 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 15637 NumberOfCodeBlocks, 15637 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 15686 ConstructedInterpolants, 317 QuantifiedInterpolants, 14837088 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 120 InterpolantComputations, 114 PerfectInterpolantSequences, 16078/17072 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-635dfa2 [2018-12-08 18:01:56,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 18:01:56,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 18:01:56,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 18:01:56,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 18:01:56,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 18:01:56,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 18:01:56,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 18:01:56,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 18:01:56,807 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 18:01:56,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 18:01:56,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 18:01:56,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 18:01:56,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 18:01:56,810 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 18:01:56,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 18:01:56,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 18:01:56,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 18:01:56,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 18:01:56,815 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 18:01:56,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 18:01:56,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 18:01:56,818 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 18:01:56,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 18:01:56,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 18:01:56,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 18:01:56,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 18:01:56,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 18:01:56,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 18:01:56,821 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 18:01:56,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 18:01:56,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 18:01:56,822 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 18:01:56,822 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 18:01:56,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 18:01:56,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 18:01:56,824 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 18:01:56,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 18:01:56,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 18:01:56,835 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 18:01:56,835 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 18:01:56,835 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 18:01:56,835 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 18:01:56,836 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 18:01:56,836 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 18:01:56,836 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 18:01:56,836 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 18:01:56,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 18:01:56,836 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 18:01:56,837 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 18:01:56,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:01:56,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 18:01:56,838 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 18:01:56,839 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 18:01:56,839 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 18:01:56,839 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 18:01:56,839 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 18:01:56,839 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan 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 -> Taipan 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 -> 0a7396ffb12cf754f13107d729c5350f83c5ce55 [2018-12-08 18:01:56,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 18:01:56,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 18:01:56,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 18:01:56,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 18:01:56,876 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 18:01:56,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-08 18:01:56,915 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/df420a2c9/07f49b7d49af413bb887c5bfd1b3ba1e/FLAG461c72290 [2018-12-08 18:01:57,348 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 18:01:57,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-12-08 18:01:57,358 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/df420a2c9/07f49b7d49af413bb887c5bfd1b3ba1e/FLAG461c72290 [2018-12-08 18:01:57,366 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bfd3bc9a-880b-491a-8092-3184cc50b803/bin-2019/utaipan/data/df420a2c9/07f49b7d49af413bb887c5bfd1b3ba1e [2018-12-08 18:01:57,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 18:01:57,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 18:01:57,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 18:01:57,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 18:01:57,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 18:01:57,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:01:57" (1/1) ... [2018-12-08 18:01:57,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:01:57, skipping insertion in model container [2018-12-08 18:01:57,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:01:57" (1/1) ... [2018-12-08 18:01:57,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 18:01:57,407 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 18:01:57,623 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:01:57,634 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 18:01:57,732 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:01:57,733 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 18:01:57,736 INFO L168 Benchmark]: Toolchain (without parser) took 367.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:57,737 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:01:57,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-08 18:01:57,738 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...