./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.06_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_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/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 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/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 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 ............................................................................................................................................................... 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-09 19:25:16,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:25:16,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:25:16,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:25:16,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:25:16,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:25:16,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:25:16,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:25:16,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:25:16,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:25:16,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:25:16,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:25:16,161 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:25:16,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:25:16,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:25:16,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:25:16,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:25:16,163 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:25:16,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:25:16,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:25:16,165 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:25:16,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:25:16,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:25:16,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:25:16,167 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:25:16,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:25:16,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:25:16,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:25:16,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:25:16,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:25:16,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:25:16,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:25:16,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:25:16,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:25:16,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:25:16,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:25:16,171 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:25:16,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:25:16,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:25:16,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:25:16,178 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:25:16,179 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:25:16,179 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:25:16,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:25:16,180 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:25:16,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:25:16,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:25:16,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:25:16,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:25:16,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:25:16,182 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_a2974603-3535-4c24-a14c-856f1ef3dc9d/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 -> 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 [2018-12-09 19:25:16,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:25:16,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:25:16,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:25:16,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:25:16,208 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:25:16,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-12-09 19:25:16,243 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/94616856f/b2a04546d50847bfa2f6adf22f62ea2b/FLAG1d09d352b [2018-12-09 19:25:16,578 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:25:16,578 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-12-09 19:25:16,588 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/94616856f/b2a04546d50847bfa2f6adf22f62ea2b/FLAG1d09d352b [2018-12-09 19:25:16,596 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/94616856f/b2a04546d50847bfa2f6adf22f62ea2b [2018-12-09 19:25:16,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:25:16,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:25:16,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:16,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:25:16,602 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:25:16,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:16,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fde7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16, skipping insertion in model container [2018-12-09 19:25:16,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:16,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:25:16,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:25:16,880 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:16,891 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:25:16,944 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:16,956 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:25:16,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16 WrapperNode [2018-12-09 19:25:16,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:16,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:16,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:25:16,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:25:16,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:16,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:16,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:16,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:25:16,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:25:16,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:25:16,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:16,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:16,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:16,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:17,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:17,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:17,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... [2018-12-09 19:25:17,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:25:17,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:25:17,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:25:17,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:25:17,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/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-09 19:25:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:25:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:25:17,063 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:25:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:25:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:25:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:25:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:25:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:25:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 19:25:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-09 19:25:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-09 19:25:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:25:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:25:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:25:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:25:17,219 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:25:17,219 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:25:17,580 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:25:17,580 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:25:17,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:17 BoogieIcfgContainer [2018-12-09 19:25:17,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:25:17,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:25:17,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:25:17,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:25:17,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:25:16" (1/3) ... [2018-12-09 19:25:17,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a08b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:17, skipping insertion in model container [2018-12-09 19:25:17,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:16" (2/3) ... [2018-12-09 19:25:17,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a08b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:17, skipping insertion in model container [2018-12-09 19:25:17,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:17" (3/3) ... [2018-12-09 19:25:17,586 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-12-09 19:25:17,592 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:25:17,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:25:17,610 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:25:17,628 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:25:17,629 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:25:17,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:25:17,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:25:17,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:25:17,629 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:25:17,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:25:17,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:25:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2018-12-09 19:25:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:25:17,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:17,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:17,647 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:17,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1787304322, now seen corresponding path program 1 times [2018-12-09 19:25:17,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:17,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:17,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:17,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:17,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:17,835 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-09 19:25:17,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:17,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:17,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:17,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:17,855 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 4 states. [2018-12-09 19:25:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:18,118 INFO L93 Difference]: Finished difference Result 355 states and 602 transitions. [2018-12-09 19:25:18,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:18,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-09 19:25:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:18,130 INFO L225 Difference]: With dead ends: 355 [2018-12-09 19:25:18,130 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 19:25:18,133 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-09 19:25:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 19:25:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2018-12-09 19:25:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-09 19:25:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 254 transitions. [2018-12-09 19:25:18,163 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 254 transitions. Word has length 50 [2018-12-09 19:25:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:18,163 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 254 transitions. [2018-12-09 19:25:18,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 254 transitions. [2018-12-09 19:25:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:25:18,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:18,165 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, 1] [2018-12-09 19:25:18,165 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:18,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2111236035, now seen corresponding path program 1 times [2018-12-09 19:25:18,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:18,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:18,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:18,236 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-09 19:25:18,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:18,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:18,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:18,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:18,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:18,239 INFO L87 Difference]: Start difference. First operand 163 states and 254 transitions. Second operand 4 states. [2018-12-09 19:25:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:18,423 INFO L93 Difference]: Finished difference Result 318 states and 493 transitions. [2018-12-09 19:25:18,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:18,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 19:25:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:18,425 INFO L225 Difference]: With dead ends: 318 [2018-12-09 19:25:18,425 INFO L226 Difference]: Without dead ends: 180 [2018-12-09 19:25:18,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-09 19:25:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-09 19:25:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2018-12-09 19:25:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-09 19:25:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions. [2018-12-09 19:25:18,432 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 63 [2018-12-09 19:25:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:18,432 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 253 transitions. [2018-12-09 19:25:18,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions. [2018-12-09 19:25:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 19:25:18,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:18,433 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-09 19:25:18,433 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:18,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:18,434 INFO L82 PathProgramCache]: Analyzing trace with hash -428284493, now seen corresponding path program 1 times [2018-12-09 19:25:18,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:18,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:18,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:18,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:18,491 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-09 19:25:18,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:18,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:18,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:18,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:18,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:18,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:18,493 INFO L87 Difference]: Start difference. First operand 163 states and 253 transitions. Second operand 5 states. [2018-12-09 19:25:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:18,792 INFO L93 Difference]: Finished difference Result 322 states and 501 transitions. [2018-12-09 19:25:18,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:18,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-09 19:25:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:18,794 INFO L225 Difference]: With dead ends: 322 [2018-12-09 19:25:18,794 INFO L226 Difference]: Without dead ends: 184 [2018-12-09 19:25:18,794 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-09 19:25:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-09 19:25:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-12-09 19:25:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-09 19:25:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 279 transitions. [2018-12-09 19:25:18,801 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 279 transitions. Word has length 64 [2018-12-09 19:25:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:18,801 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 279 transitions. [2018-12-09 19:25:18,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 279 transitions. [2018-12-09 19:25:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 19:25:18,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:18,803 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, 1] [2018-12-09 19:25:18,803 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:18,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash -222810852, now seen corresponding path program 1 times [2018-12-09 19:25:18,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:18,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:18,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:18,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:18,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:18,866 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-09 19:25:18,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:18,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:18,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:18,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:18,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:18,867 INFO L87 Difference]: Start difference. First operand 183 states and 279 transitions. Second operand 4 states. [2018-12-09 19:25:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:19,013 INFO L93 Difference]: Finished difference Result 355 states and 541 transitions. [2018-12-09 19:25:19,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:19,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 19:25:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:19,014 INFO L225 Difference]: With dead ends: 355 [2018-12-09 19:25:19,014 INFO L226 Difference]: Without dead ends: 197 [2018-12-09 19:25:19,015 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-09 19:25:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-09 19:25:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2018-12-09 19:25:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-09 19:25:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2018-12-09 19:25:19,020 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 64 [2018-12-09 19:25:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:19,021 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2018-12-09 19:25:19,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2018-12-09 19:25:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 19:25:19,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:19,022 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:19,022 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:19,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:19,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1871549179, now seen corresponding path program 1 times [2018-12-09 19:25:19,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:19,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:19,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:19,068 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-09 19:25:19,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:19,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:19,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:19,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:19,069 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand 4 states. [2018-12-09 19:25:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:19,213 INFO L93 Difference]: Finished difference Result 354 states and 539 transitions. [2018-12-09 19:25:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:19,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 19:25:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:19,214 INFO L225 Difference]: With dead ends: 354 [2018-12-09 19:25:19,214 INFO L226 Difference]: Without dead ends: 196 [2018-12-09 19:25:19,215 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-09 19:25:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-09 19:25:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2018-12-09 19:25:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-09 19:25:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 277 transitions. [2018-12-09 19:25:19,221 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 277 transitions. Word has length 64 [2018-12-09 19:25:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:19,221 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 277 transitions. [2018-12-09 19:25:19,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 277 transitions. [2018-12-09 19:25:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:25:19,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:19,222 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, 1] [2018-12-09 19:25:19,222 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:19,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2089030374, now seen corresponding path program 1 times [2018-12-09 19:25:19,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:19,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:19,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:19,277 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-09 19:25:19,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:19,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:19,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:19,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:19,278 INFO L87 Difference]: Start difference. First operand 183 states and 277 transitions. Second operand 4 states. [2018-12-09 19:25:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:19,418 INFO L93 Difference]: Finished difference Result 354 states and 538 transitions. [2018-12-09 19:25:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:19,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 19:25:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:19,419 INFO L225 Difference]: With dead ends: 354 [2018-12-09 19:25:19,419 INFO L226 Difference]: Without dead ends: 196 [2018-12-09 19:25:19,419 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-09 19:25:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-09 19:25:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2018-12-09 19:25:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-09 19:25:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 276 transitions. [2018-12-09 19:25:19,423 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 276 transitions. Word has length 65 [2018-12-09 19:25:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:19,424 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 276 transitions. [2018-12-09 19:25:19,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 276 transitions. [2018-12-09 19:25:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:25:19,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:19,424 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, 1] [2018-12-09 19:25:19,424 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:19,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 760736959, now seen corresponding path program 1 times [2018-12-09 19:25:19,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:19,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:19,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:19,457 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-09 19:25:19,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:19,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:19,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:19,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:19,458 INFO L87 Difference]: Start difference. First operand 183 states and 276 transitions. Second operand 4 states. [2018-12-09 19:25:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:19,596 INFO L93 Difference]: Finished difference Result 354 states and 537 transitions. [2018-12-09 19:25:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:19,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 19:25:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:19,597 INFO L225 Difference]: With dead ends: 354 [2018-12-09 19:25:19,597 INFO L226 Difference]: Without dead ends: 196 [2018-12-09 19:25:19,598 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-09 19:25:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-09 19:25:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2018-12-09 19:25:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-09 19:25:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 275 transitions. [2018-12-09 19:25:19,604 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 275 transitions. Word has length 66 [2018-12-09 19:25:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:19,604 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 275 transitions. [2018-12-09 19:25:19,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 275 transitions. [2018-12-09 19:25:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:25:19,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:19,605 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:19,605 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:19,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash 28444044, now seen corresponding path program 1 times [2018-12-09 19:25:19,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:19,650 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-09 19:25:19,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:19,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:19,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:19,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:19,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:19,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:19,651 INFO L87 Difference]: Start difference. First operand 183 states and 275 transitions. Second operand 4 states. [2018-12-09 19:25:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:19,805 INFO L93 Difference]: Finished difference Result 383 states and 583 transitions. [2018-12-09 19:25:19,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:19,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 19:25:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:19,806 INFO L225 Difference]: With dead ends: 383 [2018-12-09 19:25:19,806 INFO L226 Difference]: Without dead ends: 225 [2018-12-09 19:25:19,807 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-09 19:25:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-12-09 19:25:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2018-12-09 19:25:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 312 transitions. [2018-12-09 19:25:19,812 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 312 transitions. Word has length 67 [2018-12-09 19:25:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:19,812 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 312 transitions. [2018-12-09 19:25:19,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 312 transitions. [2018-12-09 19:25:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:25:19,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:19,813 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, 1] [2018-12-09 19:25:19,813 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:19,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1800450037, now seen corresponding path program 1 times [2018-12-09 19:25:19,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:19,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:19,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:19,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:19,855 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-09 19:25:19,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:19,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:19,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:19,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:19,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:19,856 INFO L87 Difference]: Start difference. First operand 205 states and 312 transitions. Second operand 4 states. [2018-12-09 19:25:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:19,993 INFO L93 Difference]: Finished difference Result 398 states and 610 transitions. [2018-12-09 19:25:19,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:19,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 19:25:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:19,994 INFO L225 Difference]: With dead ends: 398 [2018-12-09 19:25:19,994 INFO L226 Difference]: Without dead ends: 218 [2018-12-09 19:25:19,994 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-09 19:25:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-09 19:25:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 205. [2018-12-09 19:25:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 311 transitions. [2018-12-09 19:25:19,998 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 311 transitions. Word has length 67 [2018-12-09 19:25:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:19,998 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 311 transitions. [2018-12-09 19:25:19,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 311 transitions. [2018-12-09 19:25:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:19,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:19,999 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, 1] [2018-12-09 19:25:19,999 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:19,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash 368334916, now seen corresponding path program 1 times [2018-12-09 19:25:19,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:20,029 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-09 19:25:20,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:20,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:20,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:20,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:20,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:20,030 INFO L87 Difference]: Start difference. First operand 205 states and 311 transitions. Second operand 4 states. [2018-12-09 19:25:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:20,159 INFO L93 Difference]: Finished difference Result 388 states and 597 transitions. [2018-12-09 19:25:20,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:20,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 19:25:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:20,160 INFO L225 Difference]: With dead ends: 388 [2018-12-09 19:25:20,160 INFO L226 Difference]: Without dead ends: 208 [2018-12-09 19:25:20,160 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-09 19:25:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-09 19:25:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2018-12-09 19:25:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2018-12-09 19:25:20,165 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 68 [2018-12-09 19:25:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:20,165 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2018-12-09 19:25:20,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2018-12-09 19:25:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:25:20,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:20,166 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, 1] [2018-12-09 19:25:20,166 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:20,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:20,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1969762165, now seen corresponding path program 1 times [2018-12-09 19:25:20,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:20,206 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-09 19:25:20,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:20,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:20,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:20,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:20,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:20,207 INFO L87 Difference]: Start difference. First operand 205 states and 310 transitions. Second operand 4 states. [2018-12-09 19:25:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:20,391 INFO L93 Difference]: Finished difference Result 405 states and 617 transitions. [2018-12-09 19:25:20,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:20,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 19:25:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:20,393 INFO L225 Difference]: With dead ends: 405 [2018-12-09 19:25:20,393 INFO L226 Difference]: Without dead ends: 225 [2018-12-09 19:25:20,393 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-09 19:25:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-12-09 19:25:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2018-12-09 19:25:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 309 transitions. [2018-12-09 19:25:20,398 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 309 transitions. Word has length 80 [2018-12-09 19:25:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:20,398 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 309 transitions. [2018-12-09 19:25:20,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 309 transitions. [2018-12-09 19:25:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:25:20,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:20,398 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, 1] [2018-12-09 19:25:20,399 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:20,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -313533526, now seen corresponding path program 1 times [2018-12-09 19:25:20,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:20,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:20,451 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-09 19:25:20,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:20,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:20,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:20,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:20,452 INFO L87 Difference]: Start difference. First operand 205 states and 309 transitions. Second operand 4 states. [2018-12-09 19:25:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:20,635 INFO L93 Difference]: Finished difference Result 403 states and 613 transitions. [2018-12-09 19:25:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:20,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 19:25:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:20,636 INFO L225 Difference]: With dead ends: 403 [2018-12-09 19:25:20,636 INFO L226 Difference]: Without dead ends: 223 [2018-12-09 19:25:20,637 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-09 19:25:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-09 19:25:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2018-12-09 19:25:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2018-12-09 19:25:20,643 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 81 [2018-12-09 19:25:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:20,643 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2018-12-09 19:25:20,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2018-12-09 19:25:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:25:20,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:20,644 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, 1] [2018-12-09 19:25:20,644 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:20,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1780826505, now seen corresponding path program 1 times [2018-12-09 19:25:20,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:20,679 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-09 19:25:20,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:20,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:20,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:20,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:20,679 INFO L87 Difference]: Start difference. First operand 205 states and 308 transitions. Second operand 4 states. [2018-12-09 19:25:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:20,830 INFO L93 Difference]: Finished difference Result 402 states and 610 transitions. [2018-12-09 19:25:20,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:20,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 19:25:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:20,831 INFO L225 Difference]: With dead ends: 402 [2018-12-09 19:25:20,831 INFO L226 Difference]: Without dead ends: 222 [2018-12-09 19:25:20,832 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-09 19:25:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-09 19:25:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2018-12-09 19:25:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 307 transitions. [2018-12-09 19:25:20,838 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 307 transitions. Word has length 81 [2018-12-09 19:25:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:20,838 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 307 transitions. [2018-12-09 19:25:20,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 307 transitions. [2018-12-09 19:25:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:25:20,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:20,839 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, 1] [2018-12-09 19:25:20,839 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:20,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash -723372520, now seen corresponding path program 1 times [2018-12-09 19:25:20,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:20,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:20,892 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-09 19:25:20,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:20,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:20,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:20,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:20,894 INFO L87 Difference]: Start difference. First operand 205 states and 307 transitions. Second operand 4 states. [2018-12-09 19:25:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:21,069 INFO L93 Difference]: Finished difference Result 402 states and 608 transitions. [2018-12-09 19:25:21,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:21,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 19:25:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:21,070 INFO L225 Difference]: With dead ends: 402 [2018-12-09 19:25:21,070 INFO L226 Difference]: Without dead ends: 222 [2018-12-09 19:25:21,071 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-09 19:25:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-09 19:25:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2018-12-09 19:25:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 306 transitions. [2018-12-09 19:25:21,077 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 306 transitions. Word has length 82 [2018-12-09 19:25:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:21,077 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 306 transitions. [2018-12-09 19:25:21,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 306 transitions. [2018-12-09 19:25:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 19:25:21,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:21,078 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, 1] [2018-12-09 19:25:21,079 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:21,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash -524406835, now seen corresponding path program 1 times [2018-12-09 19:25:21,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:21,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:21,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:21,132 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-09 19:25:21,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:21,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:21,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:21,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:21,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:21,133 INFO L87 Difference]: Start difference. First operand 205 states and 306 transitions. Second operand 4 states. [2018-12-09 19:25:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:21,298 INFO L93 Difference]: Finished difference Result 402 states and 606 transitions. [2018-12-09 19:25:21,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:21,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 19:25:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:21,299 INFO L225 Difference]: With dead ends: 402 [2018-12-09 19:25:21,299 INFO L226 Difference]: Without dead ends: 222 [2018-12-09 19:25:21,299 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-09 19:25:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-09 19:25:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2018-12-09 19:25:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2018-12-09 19:25:21,304 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 83 [2018-12-09 19:25:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:21,304 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2018-12-09 19:25:21,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2018-12-09 19:25:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 19:25:21,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:21,304 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, 1] [2018-12-09 19:25:21,305 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:21,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1309765309, now seen corresponding path program 1 times [2018-12-09 19:25:21,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:21,336 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-09 19:25:21,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:21,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:21,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:21,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:21,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:21,337 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand 4 states. [2018-12-09 19:25:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:21,485 INFO L93 Difference]: Finished difference Result 402 states and 604 transitions. [2018-12-09 19:25:21,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:21,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-09 19:25:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:21,486 INFO L225 Difference]: With dead ends: 402 [2018-12-09 19:25:21,486 INFO L226 Difference]: Without dead ends: 222 [2018-12-09 19:25:21,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-09 19:25:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2018-12-09 19:25:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2018-12-09 19:25:21,490 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 84 [2018-12-09 19:25:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:21,490 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2018-12-09 19:25:21,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2018-12-09 19:25:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 19:25:21,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:21,491 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, 1] [2018-12-09 19:25:21,491 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:21,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1999237166, now seen corresponding path program 1 times [2018-12-09 19:25:21,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:21,526 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-09 19:25:21,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:21,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:21,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:21,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:21,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:21,527 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand 4 states. [2018-12-09 19:25:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:21,682 INFO L93 Difference]: Finished difference Result 392 states and 590 transitions. [2018-12-09 19:25:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:21,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-09 19:25:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:21,683 INFO L225 Difference]: With dead ends: 392 [2018-12-09 19:25:21,683 INFO L226 Difference]: Without dead ends: 212 [2018-12-09 19:25:21,683 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-09 19:25:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-09 19:25:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2018-12-09 19:25:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:25:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 303 transitions. [2018-12-09 19:25:21,687 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 303 transitions. Word has length 85 [2018-12-09 19:25:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:21,688 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 303 transitions. [2018-12-09 19:25:21,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 303 transitions. [2018-12-09 19:25:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 19:25:21,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:21,688 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-09 19:25:21,688 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:21,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash -276055814, now seen corresponding path program 1 times [2018-12-09 19:25:21,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:21,732 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-09 19:25:21,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:21,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:21,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:21,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:21,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:21,732 INFO L87 Difference]: Start difference. First operand 205 states and 303 transitions. Second operand 4 states. [2018-12-09 19:25:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:21,974 INFO L93 Difference]: Finished difference Result 499 states and 756 transitions. [2018-12-09 19:25:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:21,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-09 19:25:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:21,976 INFO L225 Difference]: With dead ends: 499 [2018-12-09 19:25:21,976 INFO L226 Difference]: Without dead ends: 319 [2018-12-09 19:25:21,977 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-09 19:25:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-09 19:25:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 246. [2018-12-09 19:25:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-12-09 19:25:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 376 transitions. [2018-12-09 19:25:21,984 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 376 transitions. Word has length 89 [2018-12-09 19:25:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:21,985 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 376 transitions. [2018-12-09 19:25:21,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 376 transitions. [2018-12-09 19:25:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 19:25:21,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:21,985 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-09 19:25:21,986 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:21,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash -27909320, now seen corresponding path program 1 times [2018-12-09 19:25:21,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:21,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:21,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:21,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:22,035 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-09 19:25:22,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:22,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:22,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:22,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:22,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:22,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:22,036 INFO L87 Difference]: Start difference. First operand 246 states and 376 transitions. Second operand 4 states. [2018-12-09 19:25:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:22,225 INFO L93 Difference]: Finished difference Result 516 states and 798 transitions. [2018-12-09 19:25:22,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:22,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-09 19:25:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:22,226 INFO L225 Difference]: With dead ends: 516 [2018-12-09 19:25:22,226 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 19:25:22,227 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-09 19:25:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 19:25:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 270. [2018-12-09 19:25:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-12-09 19:25:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 417 transitions. [2018-12-09 19:25:22,233 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 417 transitions. Word has length 89 [2018-12-09 19:25:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:22,233 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 417 transitions. [2018-12-09 19:25:22,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 417 transitions. [2018-12-09 19:25:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 19:25:22,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:22,234 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, 1] [2018-12-09 19:25:22,234 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:22,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1061560046, now seen corresponding path program 1 times [2018-12-09 19:25:22,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:22,289 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-09 19:25:22,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:22,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:22,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:22,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:22,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:22,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:22,290 INFO L87 Difference]: Start difference. First operand 270 states and 417 transitions. Second operand 4 states. [2018-12-09 19:25:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:22,544 INFO L93 Difference]: Finished difference Result 579 states and 897 transitions. [2018-12-09 19:25:22,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:22,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-09 19:25:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:22,545 INFO L225 Difference]: With dead ends: 579 [2018-12-09 19:25:22,545 INFO L226 Difference]: Without dead ends: 334 [2018-12-09 19:25:22,545 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-09 19:25:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-09 19:25:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2018-12-09 19:25:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 418 transitions. [2018-12-09 19:25:22,554 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 418 transitions. Word has length 90 [2018-12-09 19:25:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:22,554 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 418 transitions. [2018-12-09 19:25:22,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 418 transitions. [2018-12-09 19:25:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:25:22,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:22,555 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, 1] [2018-12-09 19:25:22,555 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:22,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1317667129, now seen corresponding path program 1 times [2018-12-09 19:25:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:22,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:22,606 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-09 19:25:22,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:22,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:22,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:22,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:22,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:22,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:22,607 INFO L87 Difference]: Start difference. First operand 271 states and 418 transitions. Second operand 4 states. [2018-12-09 19:25:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:22,879 INFO L93 Difference]: Finished difference Result 580 states and 897 transitions. [2018-12-09 19:25:22,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:22,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-09 19:25:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:22,880 INFO L225 Difference]: With dead ends: 580 [2018-12-09 19:25:22,880 INFO L226 Difference]: Without dead ends: 334 [2018-12-09 19:25:22,881 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-09 19:25:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-09 19:25:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2018-12-09 19:25:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 417 transitions. [2018-12-09 19:25:22,887 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 417 transitions. Word has length 102 [2018-12-09 19:25:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:22,887 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 417 transitions. [2018-12-09 19:25:22,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 417 transitions. [2018-12-09 19:25:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:25:22,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:22,888 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, 1] [2018-12-09 19:25:22,888 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:22,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 69118281, now seen corresponding path program 1 times [2018-12-09 19:25:22,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:22,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:22,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:22,921 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-09 19:25:22,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:22,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:22,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:22,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:22,922 INFO L87 Difference]: Start difference. First operand 271 states and 417 transitions. Second operand 4 states. [2018-12-09 19:25:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:23,105 INFO L93 Difference]: Finished difference Result 542 states and 838 transitions. [2018-12-09 19:25:23,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:23,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-09 19:25:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:23,106 INFO L225 Difference]: With dead ends: 542 [2018-12-09 19:25:23,106 INFO L226 Difference]: Without dead ends: 296 [2018-12-09 19:25:23,107 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-09 19:25:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-09 19:25:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2018-12-09 19:25:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 416 transitions. [2018-12-09 19:25:23,113 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 416 transitions. Word has length 102 [2018-12-09 19:25:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:23,113 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 416 transitions. [2018-12-09 19:25:23,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2018-12-09 19:25:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:25:23,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:23,114 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, 1] [2018-12-09 19:25:23,114 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:23,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash 855373464, now seen corresponding path program 1 times [2018-12-09 19:25:23,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:23,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:23,155 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-09 19:25:23,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:23,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:23,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:23,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:23,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:23,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:23,155 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. Second operand 4 states. [2018-12-09 19:25:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:23,369 INFO L93 Difference]: Finished difference Result 578 states and 891 transitions. [2018-12-09 19:25:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:23,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 19:25:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:23,370 INFO L225 Difference]: With dead ends: 578 [2018-12-09 19:25:23,371 INFO L226 Difference]: Without dead ends: 332 [2018-12-09 19:25:23,371 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-09 19:25:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-09 19:25:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 271. [2018-12-09 19:25:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 415 transitions. [2018-12-09 19:25:23,381 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 415 transitions. Word has length 103 [2018-12-09 19:25:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:23,381 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 415 transitions. [2018-12-09 19:25:23,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 415 transitions. [2018-12-09 19:25:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:25:23,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:23,382 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, 1] [2018-12-09 19:25:23,383 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:23,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1345233801, now seen corresponding path program 1 times [2018-12-09 19:25:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:23,429 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-09 19:25:23,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:23,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:23,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:23,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:23,430 INFO L87 Difference]: Start difference. First operand 271 states and 415 transitions. Second operand 4 states. [2018-12-09 19:25:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:23,659 INFO L93 Difference]: Finished difference Result 577 states and 888 transitions. [2018-12-09 19:25:23,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:23,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 19:25:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:23,660 INFO L225 Difference]: With dead ends: 577 [2018-12-09 19:25:23,661 INFO L226 Difference]: Without dead ends: 331 [2018-12-09 19:25:23,661 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-09 19:25:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-09 19:25:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2018-12-09 19:25:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 414 transitions. [2018-12-09 19:25:23,668 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 414 transitions. Word has length 103 [2018-12-09 19:25:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:23,668 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 414 transitions. [2018-12-09 19:25:23,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 414 transitions. [2018-12-09 19:25:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:25:23,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:23,669 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, 1] [2018-12-09 19:25:23,670 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:23,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 896048214, now seen corresponding path program 1 times [2018-12-09 19:25:23,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:23,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:23,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:23,732 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-09 19:25:23,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:23,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:23,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:23,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:23,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:23,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:23,733 INFO L87 Difference]: Start difference. First operand 271 states and 414 transitions. Second operand 4 states. [2018-12-09 19:25:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:23,881 INFO L93 Difference]: Finished difference Result 540 states and 830 transitions. [2018-12-09 19:25:23,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:23,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 19:25:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:23,882 INFO L225 Difference]: With dead ends: 540 [2018-12-09 19:25:23,882 INFO L226 Difference]: Without dead ends: 294 [2018-12-09 19:25:23,882 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-09 19:25:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-09 19:25:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 271. [2018-12-09 19:25:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2018-12-09 19:25:23,888 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 103 [2018-12-09 19:25:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:23,888 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2018-12-09 19:25:23,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2018-12-09 19:25:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:25:23,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:23,889 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, 1] [2018-12-09 19:25:23,889 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:23,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1304559051, now seen corresponding path program 1 times [2018-12-09 19:25:23,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:23,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:23,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:23,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:23,931 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-09 19:25:23,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:23,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:23,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:23,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:23,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:23,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:23,932 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand 4 states. [2018-12-09 19:25:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:24,079 INFO L93 Difference]: Finished difference Result 539 states and 827 transitions. [2018-12-09 19:25:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:24,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 19:25:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:24,080 INFO L225 Difference]: With dead ends: 539 [2018-12-09 19:25:24,080 INFO L226 Difference]: Without dead ends: 293 [2018-12-09 19:25:24,080 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-09 19:25:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-09 19:25:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2018-12-09 19:25:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2018-12-09 19:25:24,086 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 103 [2018-12-09 19:25:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:24,086 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2018-12-09 19:25:24,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2018-12-09 19:25:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 19:25:24,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:24,087 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, 1] [2018-12-09 19:25:24,087 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:24,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1153005802, now seen corresponding path program 1 times [2018-12-09 19:25:24,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:24,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:24,119 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-09 19:25:24,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:24,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:24,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:24,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:24,120 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 4 states. [2018-12-09 19:25:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:24,310 INFO L93 Difference]: Finished difference Result 577 states and 882 transitions. [2018-12-09 19:25:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:24,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 19:25:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:24,311 INFO L225 Difference]: With dead ends: 577 [2018-12-09 19:25:24,311 INFO L226 Difference]: Without dead ends: 331 [2018-12-09 19:25:24,311 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-09 19:25:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-09 19:25:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2018-12-09 19:25:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 411 transitions. [2018-12-09 19:25:24,317 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 411 transitions. Word has length 104 [2018-12-09 19:25:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 411 transitions. [2018-12-09 19:25:24,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 411 transitions. [2018-12-09 19:25:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 19:25:24,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:24,318 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, 1] [2018-12-09 19:25:24,318 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:24,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1881044244, now seen corresponding path program 1 times [2018-12-09 19:25:24,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:24,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:24,344 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-09 19:25:24,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:24,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:24,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:24,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:24,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:24,345 INFO L87 Difference]: Start difference. First operand 271 states and 411 transitions. Second operand 4 states. [2018-12-09 19:25:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:24,507 INFO L93 Difference]: Finished difference Result 539 states and 823 transitions. [2018-12-09 19:25:24,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:24,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 19:25:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:24,508 INFO L225 Difference]: With dead ends: 539 [2018-12-09 19:25:24,508 INFO L226 Difference]: Without dead ends: 293 [2018-12-09 19:25:24,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-09 19:25:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2018-12-09 19:25:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 410 transitions. [2018-12-09 19:25:24,513 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 410 transitions. Word has length 104 [2018-12-09 19:25:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:24,514 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 410 transitions. [2018-12-09 19:25:24,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 410 transitions. [2018-12-09 19:25:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:25:24,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:24,514 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, 1] [2018-12-09 19:25:24,514 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:24,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1808746299, now seen corresponding path program 1 times [2018-12-09 19:25:24,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:24,559 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-09 19:25:24,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:24,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:24,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:24,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:24,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:24,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:24,560 INFO L87 Difference]: Start difference. First operand 271 states and 410 transitions. Second operand 4 states. [2018-12-09 19:25:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:24,766 INFO L93 Difference]: Finished difference Result 577 states and 878 transitions. [2018-12-09 19:25:24,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:24,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-09 19:25:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:24,767 INFO L225 Difference]: With dead ends: 577 [2018-12-09 19:25:24,767 INFO L226 Difference]: Without dead ends: 331 [2018-12-09 19:25:24,768 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-09 19:25:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-09 19:25:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2018-12-09 19:25:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 409 transitions. [2018-12-09 19:25:24,774 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 409 transitions. Word has length 105 [2018-12-09 19:25:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:24,774 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 409 transitions. [2018-12-09 19:25:24,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2018-12-09 19:25:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:25:24,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:24,775 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, 1] [2018-12-09 19:25:24,775 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:24,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2052491911, now seen corresponding path program 1 times [2018-12-09 19:25:24,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:24,803 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-09 19:25:24,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:24,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:24,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:24,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:24,804 INFO L87 Difference]: Start difference. First operand 271 states and 409 transitions. Second operand 4 states. [2018-12-09 19:25:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:24,966 INFO L93 Difference]: Finished difference Result 539 states and 819 transitions. [2018-12-09 19:25:24,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:24,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-09 19:25:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:24,967 INFO L225 Difference]: With dead ends: 539 [2018-12-09 19:25:24,968 INFO L226 Difference]: Without dead ends: 293 [2018-12-09 19:25:24,968 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-09 19:25:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-09 19:25:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2018-12-09 19:25:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 408 transitions. [2018-12-09 19:25:24,975 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 408 transitions. Word has length 105 [2018-12-09 19:25:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:24,975 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 408 transitions. [2018-12-09 19:25:24,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 408 transitions. [2018-12-09 19:25:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 19:25:24,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:24,976 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, 1] [2018-12-09 19:25:24,976 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:24,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash 623068431, now seen corresponding path program 1 times [2018-12-09 19:25:24,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:24,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:25,007 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-09 19:25:25,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:25,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:25,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:25,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:25,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:25,008 INFO L87 Difference]: Start difference. First operand 271 states and 408 transitions. Second operand 4 states. [2018-12-09 19:25:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:25,197 INFO L93 Difference]: Finished difference Result 577 states and 874 transitions. [2018-12-09 19:25:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:25,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-09 19:25:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:25,198 INFO L225 Difference]: With dead ends: 577 [2018-12-09 19:25:25,198 INFO L226 Difference]: Without dead ends: 331 [2018-12-09 19:25:25,199 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-09 19:25:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-09 19:25:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2018-12-09 19:25:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 407 transitions. [2018-12-09 19:25:25,207 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 407 transitions. Word has length 106 [2018-12-09 19:25:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:25,208 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 407 transitions. [2018-12-09 19:25:25,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 407 transitions. [2018-12-09 19:25:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 19:25:25,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:25,208 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, 1] [2018-12-09 19:25:25,208 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:25,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:25,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1183768209, now seen corresponding path program 1 times [2018-12-09 19:25:25,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:25,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:25,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:25,244 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-09 19:25:25,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:25,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:25,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:25,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:25,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:25,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:25,245 INFO L87 Difference]: Start difference. First operand 271 states and 407 transitions. Second operand 4 states. [2018-12-09 19:25:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:25,397 INFO L93 Difference]: Finished difference Result 539 states and 815 transitions. [2018-12-09 19:25:25,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:25,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-09 19:25:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:25,398 INFO L225 Difference]: With dead ends: 539 [2018-12-09 19:25:25,398 INFO L226 Difference]: Without dead ends: 293 [2018-12-09 19:25:25,399 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-09 19:25:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-09 19:25:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 271. [2018-12-09 19:25:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 406 transitions. [2018-12-09 19:25:25,411 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 406 transitions. Word has length 106 [2018-12-09 19:25:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:25,411 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 406 transitions. [2018-12-09 19:25:25,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 406 transitions. [2018-12-09 19:25:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:25:25,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:25,412 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, 1] [2018-12-09 19:25:25,412 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:25,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1812003904, now seen corresponding path program 1 times [2018-12-09 19:25:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:25,454 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-09 19:25:25,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:25,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:25,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:25,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:25,455 INFO L87 Difference]: Start difference. First operand 271 states and 406 transitions. Second operand 4 states. [2018-12-09 19:25:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:25,656 INFO L93 Difference]: Finished difference Result 567 states and 858 transitions. [2018-12-09 19:25:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:25,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 19:25:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:25,657 INFO L225 Difference]: With dead ends: 567 [2018-12-09 19:25:25,657 INFO L226 Difference]: Without dead ends: 321 [2018-12-09 19:25:25,658 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-09 19:25:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-09 19:25:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2018-12-09 19:25:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 405 transitions. [2018-12-09 19:25:25,666 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 405 transitions. Word has length 107 [2018-12-09 19:25:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:25,667 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 405 transitions. [2018-12-09 19:25:25,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 405 transitions. [2018-12-09 19:25:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 19:25:25,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:25,668 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, 1] [2018-12-09 19:25:25,668 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:25,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1610179970, now seen corresponding path program 1 times [2018-12-09 19:25:25,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:25,726 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-09 19:25:25,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:25,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:25,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:25,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:25,727 INFO L87 Difference]: Start difference. First operand 271 states and 405 transitions. Second operand 4 states. [2018-12-09 19:25:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:25,866 INFO L93 Difference]: Finished difference Result 529 states and 799 transitions. [2018-12-09 19:25:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:25,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-09 19:25:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:25,867 INFO L225 Difference]: With dead ends: 529 [2018-12-09 19:25:25,867 INFO L226 Difference]: Without dead ends: 283 [2018-12-09 19:25:25,867 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-09 19:25:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-09 19:25:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 271. [2018-12-09 19:25:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 404 transitions. [2018-12-09 19:25:25,873 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 404 transitions. Word has length 107 [2018-12-09 19:25:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:25,874 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 404 transitions. [2018-12-09 19:25:25,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 404 transitions. [2018-12-09 19:25:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:25:25,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:25,874 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:25,874 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:25,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -754053414, now seen corresponding path program 1 times [2018-12-09 19:25:25,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:25,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:25,919 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-09 19:25:25,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:25,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:25,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:25,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:25,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:25,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:25,919 INFO L87 Difference]: Start difference. First operand 271 states and 404 transitions. Second operand 4 states. [2018-12-09 19:25:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:26,108 INFO L93 Difference]: Finished difference Result 567 states and 854 transitions. [2018-12-09 19:25:26,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:26,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 19:25:26,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:26,109 INFO L225 Difference]: With dead ends: 567 [2018-12-09 19:25:26,109 INFO L226 Difference]: Without dead ends: 321 [2018-12-09 19:25:26,110 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-09 19:25:26,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-09 19:25:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 271. [2018-12-09 19:25:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-09 19:25:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 403 transitions. [2018-12-09 19:25:26,116 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 403 transitions. Word has length 111 [2018-12-09 19:25:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:26,116 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 403 transitions. [2018-12-09 19:25:26,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 403 transitions. [2018-12-09 19:25:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 19:25:26,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:26,117 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:26,117 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:26,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash -808446312, now seen corresponding path program 1 times [2018-12-09 19:25:26,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:26,146 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-09 19:25:26,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:26,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:26,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:26,147 INFO L87 Difference]: Start difference. First operand 271 states and 403 transitions. Second operand 4 states. [2018-12-09 19:25:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:26,305 INFO L93 Difference]: Finished difference Result 570 states and 859 transitions. [2018-12-09 19:25:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:26,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 19:25:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:26,306 INFO L225 Difference]: With dead ends: 570 [2018-12-09 19:25:26,306 INFO L226 Difference]: Without dead ends: 324 [2018-12-09 19:25:26,307 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-09 19:25:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-09 19:25:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 297. [2018-12-09 19:25:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 448 transitions. [2018-12-09 19:25:26,313 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 448 transitions. Word has length 111 [2018-12-09 19:25:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:26,314 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 448 transitions. [2018-12-09 19:25:26,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 448 transitions. [2018-12-09 19:25:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 19:25:26,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:26,314 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:26,314 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:26,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1331646666, now seen corresponding path program 1 times [2018-12-09 19:25:26,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:26,354 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-09 19:25:26,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:26,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:26,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:26,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:26,356 INFO L87 Difference]: Start difference. First operand 297 states and 448 transitions. Second operand 4 states. [2018-12-09 19:25:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:26,547 INFO L93 Difference]: Finished difference Result 619 states and 942 transitions. [2018-12-09 19:25:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:26,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-09 19:25:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:26,548 INFO L225 Difference]: With dead ends: 619 [2018-12-09 19:25:26,548 INFO L226 Difference]: Without dead ends: 347 [2018-12-09 19:25:26,548 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-09 19:25:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-09 19:25:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 297. [2018-12-09 19:25:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 447 transitions. [2018-12-09 19:25:26,556 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 447 transitions. Word has length 114 [2018-12-09 19:25:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:26,556 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 447 transitions. [2018-12-09 19:25:26,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 447 transitions. [2018-12-09 19:25:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 19:25:26,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:26,556 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, 1] [2018-12-09 19:25:26,556 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:26,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1627099867, now seen corresponding path program 1 times [2018-12-09 19:25:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:26,587 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-09 19:25:26,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:26,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:26,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:26,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:26,588 INFO L87 Difference]: Start difference. First operand 297 states and 447 transitions. Second operand 4 states. [2018-12-09 19:25:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:26,763 INFO L93 Difference]: Finished difference Result 611 states and 927 transitions. [2018-12-09 19:25:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:26,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-09 19:25:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:26,764 INFO L225 Difference]: With dead ends: 611 [2018-12-09 19:25:26,764 INFO L226 Difference]: Without dead ends: 339 [2018-12-09 19:25:26,765 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-09 19:25:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-09 19:25:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2018-12-09 19:25:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 446 transitions. [2018-12-09 19:25:26,773 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 446 transitions. Word has length 115 [2018-12-09 19:25:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:26,773 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 446 transitions. [2018-12-09 19:25:26,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 446 transitions. [2018-12-09 19:25:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 19:25:26,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:26,773 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:26,773 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:26,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1359320278, now seen corresponding path program 1 times [2018-12-09 19:25:26,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:26,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:26,816 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-09 19:25:26,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:26,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:26,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:26,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:26,817 INFO L87 Difference]: Start difference. First operand 297 states and 446 transitions. Second operand 4 states. [2018-12-09 19:25:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:26,995 INFO L93 Difference]: Finished difference Result 611 states and 925 transitions. [2018-12-09 19:25:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:26,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-09 19:25:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:26,996 INFO L225 Difference]: With dead ends: 611 [2018-12-09 19:25:26,996 INFO L226 Difference]: Without dead ends: 339 [2018-12-09 19:25:26,997 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-09 19:25:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-09 19:25:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2018-12-09 19:25:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 445 transitions. [2018-12-09 19:25:27,005 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 445 transitions. Word has length 116 [2018-12-09 19:25:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:27,005 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 445 transitions. [2018-12-09 19:25:27,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 445 transitions. [2018-12-09 19:25:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 19:25:27,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:27,005 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:27,005 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:27,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1758165539, now seen corresponding path program 1 times [2018-12-09 19:25:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:27,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:27,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:27,045 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-09 19:25:27,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:27,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:27,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:27,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:27,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:27,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:27,046 INFO L87 Difference]: Start difference. First operand 297 states and 445 transitions. Second operand 4 states. [2018-12-09 19:25:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:27,243 INFO L93 Difference]: Finished difference Result 611 states and 923 transitions. [2018-12-09 19:25:27,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:27,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-09 19:25:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:27,244 INFO L225 Difference]: With dead ends: 611 [2018-12-09 19:25:27,244 INFO L226 Difference]: Without dead ends: 339 [2018-12-09 19:25:27,245 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-09 19:25:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-09 19:25:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2018-12-09 19:25:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2018-12-09 19:25:27,252 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 117 [2018-12-09 19:25:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:27,252 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2018-12-09 19:25:27,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2018-12-09 19:25:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 19:25:27,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:27,253 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, 1] [2018-12-09 19:25:27,253 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:27,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 326346139, now seen corresponding path program 1 times [2018-12-09 19:25:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:27,286 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-09 19:25:27,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:27,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:27,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:27,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:27,287 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand 4 states. [2018-12-09 19:25:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:27,470 INFO L93 Difference]: Finished difference Result 609 states and 919 transitions. [2018-12-09 19:25:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:27,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-09 19:25:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:27,471 INFO L225 Difference]: With dead ends: 609 [2018-12-09 19:25:27,471 INFO L226 Difference]: Without dead ends: 337 [2018-12-09 19:25:27,471 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-09 19:25:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-09 19:25:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 297. [2018-12-09 19:25:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 443 transitions. [2018-12-09 19:25:27,480 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 443 transitions. Word has length 117 [2018-12-09 19:25:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:27,480 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 443 transitions. [2018-12-09 19:25:27,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2018-12-09 19:25:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 19:25:27,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:27,480 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, 1] [2018-12-09 19:25:27,481 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:27,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1390306316, now seen corresponding path program 1 times [2018-12-09 19:25:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:27,515 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-09 19:25:27,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:27,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:27,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:27,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:27,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:27,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:27,516 INFO L87 Difference]: Start difference. First operand 297 states and 443 transitions. Second operand 4 states. [2018-12-09 19:25:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:27,687 INFO L93 Difference]: Finished difference Result 606 states and 913 transitions. [2018-12-09 19:25:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:27,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-09 19:25:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:27,688 INFO L225 Difference]: With dead ends: 606 [2018-12-09 19:25:27,688 INFO L226 Difference]: Without dead ends: 334 [2018-12-09 19:25:27,689 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-09 19:25:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-09 19:25:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 297. [2018-12-09 19:25:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 442 transitions. [2018-12-09 19:25:27,697 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 442 transitions. Word has length 118 [2018-12-09 19:25:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:27,697 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 442 transitions. [2018-12-09 19:25:27,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2018-12-09 19:25:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 19:25:27,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:27,697 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, 1] [2018-12-09 19:25:27,698 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:27,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash -721473774, now seen corresponding path program 1 times [2018-12-09 19:25:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:27,733 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-09 19:25:27,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:27,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:27,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:27,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:27,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:27,733 INFO L87 Difference]: Start difference. First operand 297 states and 442 transitions. Second operand 4 states. [2018-12-09 19:25:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:27,893 INFO L93 Difference]: Finished difference Result 604 states and 908 transitions. [2018-12-09 19:25:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:27,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-09 19:25:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:27,894 INFO L225 Difference]: With dead ends: 604 [2018-12-09 19:25:27,895 INFO L226 Difference]: Without dead ends: 332 [2018-12-09 19:25:27,895 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-09 19:25:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-09 19:25:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 297. [2018-12-09 19:25:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2018-12-09 19:25:27,904 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 118 [2018-12-09 19:25:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:27,904 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2018-12-09 19:25:27,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2018-12-09 19:25:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 19:25:27,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:27,905 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, 1] [2018-12-09 19:25:27,905 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:27,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash 428984257, now seen corresponding path program 1 times [2018-12-09 19:25:27,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:27,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:27,957 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-09 19:25:27,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:27,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:27,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:27,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:27,958 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand 4 states. [2018-12-09 19:25:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:28,126 INFO L93 Difference]: Finished difference Result 604 states and 906 transitions. [2018-12-09 19:25:28,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:28,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 19:25:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:28,127 INFO L225 Difference]: With dead ends: 604 [2018-12-09 19:25:28,127 INFO L226 Difference]: Without dead ends: 332 [2018-12-09 19:25:28,127 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-09 19:25:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-12-09 19:25:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 297. [2018-12-09 19:25:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 440 transitions. [2018-12-09 19:25:28,135 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 440 transitions. Word has length 121 [2018-12-09 19:25:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:28,136 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 440 transitions. [2018-12-09 19:25:28,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2018-12-09 19:25:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 19:25:28,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:28,136 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, 1] [2018-12-09 19:25:28,136 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:28,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:28,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1115470805, now seen corresponding path program 1 times [2018-12-09 19:25:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:28,172 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-09 19:25:28,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:28,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:28,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:28,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:28,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:28,172 INFO L87 Difference]: Start difference. First operand 297 states and 440 transitions. Second operand 4 states. [2018-12-09 19:25:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:28,348 INFO L93 Difference]: Finished difference Result 598 states and 895 transitions. [2018-12-09 19:25:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:28,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-09 19:25:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:28,349 INFO L225 Difference]: With dead ends: 598 [2018-12-09 19:25:28,349 INFO L226 Difference]: Without dead ends: 326 [2018-12-09 19:25:28,349 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-09 19:25:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-09 19:25:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2018-12-09 19:25:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 439 transitions. [2018-12-09 19:25:28,357 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 439 transitions. Word has length 122 [2018-12-09 19:25:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:28,358 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 439 transitions. [2018-12-09 19:25:28,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2018-12-09 19:25:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 19:25:28,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:28,358 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, 1] [2018-12-09 19:25:28,358 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:28,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:28,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1971305990, now seen corresponding path program 1 times [2018-12-09 19:25:28,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:28,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:28,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:28,403 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-09 19:25:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:28,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:28,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:28,404 INFO L87 Difference]: Start difference. First operand 297 states and 439 transitions. Second operand 4 states. [2018-12-09 19:25:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:28,571 INFO L93 Difference]: Finished difference Result 598 states and 893 transitions. [2018-12-09 19:25:28,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:28,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-09 19:25:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:28,573 INFO L225 Difference]: With dead ends: 598 [2018-12-09 19:25:28,573 INFO L226 Difference]: Without dead ends: 326 [2018-12-09 19:25:28,573 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-09 19:25:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-09 19:25:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 297. [2018-12-09 19:25:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 438 transitions. [2018-12-09 19:25:28,582 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 438 transitions. Word has length 122 [2018-12-09 19:25:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:28,582 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 438 transitions. [2018-12-09 19:25:28,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 438 transitions. [2018-12-09 19:25:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 19:25:28,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:28,582 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, 1] [2018-12-09 19:25:28,582 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:28,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1387637702, now seen corresponding path program 1 times [2018-12-09 19:25:28,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:28,621 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-09 19:25:28,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:28,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:28,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:28,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:28,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:28,622 INFO L87 Difference]: Start difference. First operand 297 states and 438 transitions. Second operand 4 states. [2018-12-09 19:25:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:28,801 INFO L93 Difference]: Finished difference Result 595 states and 887 transitions. [2018-12-09 19:25:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:28,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-09 19:25:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:28,802 INFO L225 Difference]: With dead ends: 595 [2018-12-09 19:25:28,802 INFO L226 Difference]: Without dead ends: 323 [2018-12-09 19:25:28,803 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-09 19:25:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-09 19:25:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 297. [2018-12-09 19:25:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 437 transitions. [2018-12-09 19:25:28,816 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 437 transitions. Word has length 123 [2018-12-09 19:25:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:28,816 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 437 transitions. [2018-12-09 19:25:28,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 437 transitions. [2018-12-09 19:25:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 19:25:28,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:28,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, 1] [2018-12-09 19:25:28,817 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:28,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:28,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2006709310, now seen corresponding path program 1 times [2018-12-09 19:25:28,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:28,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:28,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:28,870 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-09 19:25:28,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:28,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:28,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:28,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:28,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:28,871 INFO L87 Difference]: Start difference. First operand 297 states and 437 transitions. Second operand 4 states. [2018-12-09 19:25:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:29,028 INFO L93 Difference]: Finished difference Result 595 states and 885 transitions. [2018-12-09 19:25:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:29,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-09 19:25:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:29,030 INFO L225 Difference]: With dead ends: 595 [2018-12-09 19:25:29,030 INFO L226 Difference]: Without dead ends: 323 [2018-12-09 19:25:29,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-09 19:25:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 297. [2018-12-09 19:25:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 19:25:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 436 transitions. [2018-12-09 19:25:29,039 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 436 transitions. Word has length 124 [2018-12-09 19:25:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:29,039 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 436 transitions. [2018-12-09 19:25:29,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 436 transitions. [2018-12-09 19:25:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 19:25:29,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:29,039 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, 1] [2018-12-09 19:25:29,039 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:29,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:29,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1490235881, now seen corresponding path program 1 times [2018-12-09 19:25:29,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:29,086 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-09 19:25:29,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:29,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:29,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:29,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:29,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:29,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:29,087 INFO L87 Difference]: Start difference. First operand 297 states and 436 transitions. Second operand 4 states. [2018-12-09 19:25:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:29,274 INFO L93 Difference]: Finished difference Result 641 states and 956 transitions. [2018-12-09 19:25:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:29,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-09 19:25:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:29,275 INFO L225 Difference]: With dead ends: 641 [2018-12-09 19:25:29,275 INFO L226 Difference]: Without dead ends: 369 [2018-12-09 19:25:29,276 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-09 19:25:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-09 19:25:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 329. [2018-12-09 19:25:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-09 19:25:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 493 transitions. [2018-12-09 19:25:29,285 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 493 transitions. Word has length 124 [2018-12-09 19:25:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:29,285 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 493 transitions. [2018-12-09 19:25:29,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 493 transitions. [2018-12-09 19:25:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 19:25:29,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:29,286 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, 1] [2018-12-09 19:25:29,286 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:29,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:29,286 INFO L82 PathProgramCache]: Analyzing trace with hash -324530706, now seen corresponding path program 1 times [2018-12-09 19:25:29,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:29,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:29,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:29,320 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-09 19:25:29,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:29,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:29,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:29,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:29,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:29,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:29,321 INFO L87 Difference]: Start difference. First operand 329 states and 493 transitions. Second operand 4 states. [2018-12-09 19:25:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:29,487 INFO L93 Difference]: Finished difference Result 656 states and 993 transitions. [2018-12-09 19:25:29,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:29,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-09 19:25:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:29,488 INFO L225 Difference]: With dead ends: 656 [2018-12-09 19:25:29,488 INFO L226 Difference]: Without dead ends: 352 [2018-12-09 19:25:29,489 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-09 19:25:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-12-09 19:25:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 329. [2018-12-09 19:25:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-09 19:25:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 492 transitions. [2018-12-09 19:25:29,498 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 492 transitions. Word has length 125 [2018-12-09 19:25:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:29,498 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 492 transitions. [2018-12-09 19:25:29,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 492 transitions. [2018-12-09 19:25:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 19:25:29,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:29,499 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-09 19:25:29,499 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:29,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash -199586411, now seen corresponding path program 1 times [2018-12-09 19:25:29,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:29,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:29,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:29,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:29,533 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-09 19:25:29,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:29,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:29,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:29,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:29,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:29,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:29,534 INFO L87 Difference]: Start difference. First operand 329 states and 492 transitions. Second operand 4 states. [2018-12-09 19:25:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:29,997 INFO L93 Difference]: Finished difference Result 745 states and 1132 transitions. [2018-12-09 19:25:29,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:29,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-09 19:25:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:30,000 INFO L225 Difference]: With dead ends: 745 [2018-12-09 19:25:30,000 INFO L226 Difference]: Without dead ends: 441 [2018-12-09 19:25:30,001 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-09 19:25:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-12-09 19:25:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 368. [2018-12-09 19:25:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-09 19:25:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 563 transitions. [2018-12-09 19:25:30,021 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 563 transitions. Word has length 125 [2018-12-09 19:25:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:30,021 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 563 transitions. [2018-12-09 19:25:30,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 563 transitions. [2018-12-09 19:25:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 19:25:30,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:30,022 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, 1] [2018-12-09 19:25:30,022 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:30,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1986630772, now seen corresponding path program 1 times [2018-12-09 19:25:30,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:30,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:30,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:30,062 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-09 19:25:30,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:30,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:30,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:30,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:30,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:30,063 INFO L87 Difference]: Start difference. First operand 368 states and 563 transitions. Second operand 4 states. [2018-12-09 19:25:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:30,234 INFO L93 Difference]: Finished difference Result 738 states and 1133 transitions. [2018-12-09 19:25:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:30,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-09 19:25:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:30,236 INFO L225 Difference]: With dead ends: 738 [2018-12-09 19:25:30,236 INFO L226 Difference]: Without dead ends: 395 [2018-12-09 19:25:30,237 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-09 19:25:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-12-09 19:25:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 368. [2018-12-09 19:25:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-09 19:25:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 562 transitions. [2018-12-09 19:25:30,252 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 562 transitions. Word has length 126 [2018-12-09 19:25:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:30,253 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 562 transitions. [2018-12-09 19:25:30,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 562 transitions. [2018-12-09 19:25:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 19:25:30,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:30,253 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, 1] [2018-12-09 19:25:30,254 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:30,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:30,254 INFO L82 PathProgramCache]: Analyzing trace with hash -862855757, now seen corresponding path program 1 times [2018-12-09 19:25:30,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:30,292 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-09 19:25:30,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:30,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:30,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:30,293 INFO L87 Difference]: Start difference. First operand 368 states and 562 transitions. Second operand 4 states. [2018-12-09 19:25:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:30,530 INFO L93 Difference]: Finished difference Result 775 states and 1187 transitions. [2018-12-09 19:25:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:30,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-09 19:25:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:30,532 INFO L225 Difference]: With dead ends: 775 [2018-12-09 19:25:30,532 INFO L226 Difference]: Without dead ends: 432 [2018-12-09 19:25:30,533 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-09 19:25:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-12-09 19:25:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 367. [2018-12-09 19:25:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-09 19:25:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 561 transitions. [2018-12-09 19:25:30,547 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 561 transitions. Word has length 126 [2018-12-09 19:25:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:30,548 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 561 transitions. [2018-12-09 19:25:30,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 561 transitions. [2018-12-09 19:25:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 19:25:30,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:30,548 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, 1] [2018-12-09 19:25:30,548 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:30,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1030706983, now seen corresponding path program 1 times [2018-12-09 19:25:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:30,580 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-09 19:25:30,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:30,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:30,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:30,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:30,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:30,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:30,581 INFO L87 Difference]: Start difference. First operand 367 states and 561 transitions. Second operand 4 states. [2018-12-09 19:25:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:30,762 INFO L93 Difference]: Finished difference Result 736 states and 1129 transitions. [2018-12-09 19:25:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:30,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 19:25:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:30,763 INFO L225 Difference]: With dead ends: 736 [2018-12-09 19:25:30,763 INFO L226 Difference]: Without dead ends: 394 [2018-12-09 19:25:30,763 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-09 19:25:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-09 19:25:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2018-12-09 19:25:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-09 19:25:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 560 transitions. [2018-12-09 19:25:30,775 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 560 transitions. Word has length 127 [2018-12-09 19:25:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:30,775 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 560 transitions. [2018-12-09 19:25:30,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 560 transitions. [2018-12-09 19:25:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 19:25:30,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:30,776 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, 1] [2018-12-09 19:25:30,776 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:30,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1500637391, now seen corresponding path program 1 times [2018-12-09 19:25:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:30,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:30,805 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-09 19:25:30,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:30,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:30,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:30,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:30,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:30,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:30,806 INFO L87 Difference]: Start difference. First operand 367 states and 560 transitions. Second operand 4 states. [2018-12-09 19:25:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:30,984 INFO L93 Difference]: Finished difference Result 736 states and 1127 transitions. [2018-12-09 19:25:30,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:30,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-09 19:25:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:30,985 INFO L225 Difference]: With dead ends: 736 [2018-12-09 19:25:30,985 INFO L226 Difference]: Without dead ends: 394 [2018-12-09 19:25:30,985 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-09 19:25:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-09 19:25:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 367. [2018-12-09 19:25:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-09 19:25:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 559 transitions. [2018-12-09 19:25:31,001 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 559 transitions. Word has length 128 [2018-12-09 19:25:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:31,001 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 559 transitions. [2018-12-09 19:25:31,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 559 transitions. [2018-12-09 19:25:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 19:25:31,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:31,002 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, 1] [2018-12-09 19:25:31,002 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:31,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1072592350, now seen corresponding path program 1 times [2018-12-09 19:25:31,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:31,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:31,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:31,060 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-09 19:25:31,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:31,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:31,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:31,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:31,061 INFO L87 Difference]: Start difference. First operand 367 states and 559 transitions. Second operand 4 states. [2018-12-09 19:25:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:31,222 INFO L93 Difference]: Finished difference Result 726 states and 1113 transitions. [2018-12-09 19:25:31,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:31,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-09 19:25:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:31,223 INFO L225 Difference]: With dead ends: 726 [2018-12-09 19:25:31,223 INFO L226 Difference]: Without dead ends: 384 [2018-12-09 19:25:31,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-09 19:25:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-12-09 19:25:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 367. [2018-12-09 19:25:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-09 19:25:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 558 transitions. [2018-12-09 19:25:31,234 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 558 transitions. Word has length 129 [2018-12-09 19:25:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:31,234 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 558 transitions. [2018-12-09 19:25:31,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 558 transitions. [2018-12-09 19:25:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 19:25:31,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:31,235 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] [2018-12-09 19:25:31,235 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:31,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:31,235 INFO L82 PathProgramCache]: Analyzing trace with hash -505526296, now seen corresponding path program 1 times [2018-12-09 19:25:31,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:31,260 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-09 19:25:31,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:31,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:25:31,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:31,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:25:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:25:31,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:25:31,261 INFO L87 Difference]: Start difference. First operand 367 states and 558 transitions. Second operand 3 states. [2018-12-09 19:25:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:31,324 INFO L93 Difference]: Finished difference Result 1047 states and 1613 transitions. [2018-12-09 19:25:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:25:31,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-12-09 19:25:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:31,326 INFO L225 Difference]: With dead ends: 1047 [2018-12-09 19:25:31,326 INFO L226 Difference]: Without dead ends: 705 [2018-12-09 19:25:31,326 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-09 19:25:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-12-09 19:25:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 703. [2018-12-09 19:25:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-12-09 19:25:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1064 transitions. [2018-12-09 19:25:31,347 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1064 transitions. Word has length 130 [2018-12-09 19:25:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:31,348 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1064 transitions. [2018-12-09 19:25:31,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:25:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1064 transitions. [2018-12-09 19:25:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 19:25:31,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:31,348 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-09 19:25:31,348 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:31,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1659632541, now seen corresponding path program 1 times [2018-12-09 19:25:31,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:31,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:31,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:31,380 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-09 19:25:31,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:31,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:31,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:31,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:31,381 INFO L87 Difference]: Start difference. First operand 703 states and 1064 transitions. Second operand 4 states. [2018-12-09 19:25:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:31,640 INFO L93 Difference]: Finished difference Result 1601 states and 2436 transitions. [2018-12-09 19:25:31,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:31,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-12-09 19:25:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:31,641 INFO L225 Difference]: With dead ends: 1601 [2018-12-09 19:25:31,642 INFO L226 Difference]: Without dead ends: 923 [2018-12-09 19:25:31,642 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-09 19:25:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-09 19:25:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 781. [2018-12-09 19:25:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-12-09 19:25:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1206 transitions. [2018-12-09 19:25:31,665 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1206 transitions. Word has length 133 [2018-12-09 19:25:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:31,665 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1206 transitions. [2018-12-09 19:25:31,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1206 transitions. [2018-12-09 19:25:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-09 19:25:31,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:31,666 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, 1, 1] [2018-12-09 19:25:31,666 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:31,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1120354469, now seen corresponding path program 1 times [2018-12-09 19:25:31,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:31,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:31,697 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-09 19:25:31,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:31,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:31,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:31,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:31,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:31,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:31,698 INFO L87 Difference]: Start difference. First operand 781 states and 1206 transitions. Second operand 4 states. [2018-12-09 19:25:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:31,993 INFO L93 Difference]: Finished difference Result 1665 states and 2558 transitions. [2018-12-09 19:25:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:31,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-12-09 19:25:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:31,996 INFO L225 Difference]: With dead ends: 1665 [2018-12-09 19:25:31,996 INFO L226 Difference]: Without dead ends: 909 [2018-12-09 19:25:31,997 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-09 19:25:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-09 19:25:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 703. [2018-12-09 19:25:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-12-09 19:25:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1064 transitions. [2018-12-09 19:25:32,023 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1064 transitions. Word has length 134 [2018-12-09 19:25:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:32,024 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 1064 transitions. [2018-12-09 19:25:32,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1064 transitions. [2018-12-09 19:25:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-09 19:25:32,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:32,025 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, 1, 1] [2018-12-09 19:25:32,025 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:32,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash -791179416, now seen corresponding path program 1 times [2018-12-09 19:25:32,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:32,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:32,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:32,068 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-09 19:25:32,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:32,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:32,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:32,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:32,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:32,068 INFO L87 Difference]: Start difference. First operand 703 states and 1064 transitions. Second operand 4 states. [2018-12-09 19:25:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:32,262 INFO L93 Difference]: Finished difference Result 1413 states and 2144 transitions. [2018-12-09 19:25:32,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:32,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-12-09 19:25:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:32,264 INFO L225 Difference]: With dead ends: 1413 [2018-12-09 19:25:32,264 INFO L226 Difference]: Without dead ends: 735 [2018-12-09 19:25:32,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-09 19:25:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 709. [2018-12-09 19:25:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-12-09 19:25:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1070 transitions. [2018-12-09 19:25:32,289 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1070 transitions. Word has length 135 [2018-12-09 19:25:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:32,289 INFO L480 AbstractCegarLoop]: Abstraction has 709 states and 1070 transitions. [2018-12-09 19:25:32,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1070 transitions. [2018-12-09 19:25:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 19:25:32,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:32,290 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, 1] [2018-12-09 19:25:32,290 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:32,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:32,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1002513435, now seen corresponding path program 1 times [2018-12-09 19:25:32,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:32,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:32,328 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-09 19:25:32,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:32,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:32,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:32,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:32,329 INFO L87 Difference]: Start difference. First operand 709 states and 1070 transitions. Second operand 4 states. [2018-12-09 19:25:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:32,515 INFO L93 Difference]: Finished difference Result 1427 states and 2158 transitions. [2018-12-09 19:25:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:32,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-09 19:25:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:32,517 INFO L225 Difference]: With dead ends: 1427 [2018-12-09 19:25:32,517 INFO L226 Difference]: Without dead ends: 743 [2018-12-09 19:25:32,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-09 19:25:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 709. [2018-12-09 19:25:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-12-09 19:25:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1068 transitions. [2018-12-09 19:25:32,541 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1068 transitions. Word has length 139 [2018-12-09 19:25:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:32,541 INFO L480 AbstractCegarLoop]: Abstraction has 709 states and 1068 transitions. [2018-12-09 19:25:32,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1068 transitions. [2018-12-09 19:25:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 19:25:32,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:32,541 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, 1] [2018-12-09 19:25:32,542 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:32,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:32,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2141102399, now seen corresponding path program 1 times [2018-12-09 19:25:32,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:32,598 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-09 19:25:32,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:32,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:32,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:32,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:32,599 INFO L87 Difference]: Start difference. First operand 709 states and 1068 transitions. Second operand 4 states. [2018-12-09 19:25:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:32,828 INFO L93 Difference]: Finished difference Result 1519 states and 2304 transitions. [2018-12-09 19:25:32,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:32,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-09 19:25:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:32,830 INFO L225 Difference]: With dead ends: 1519 [2018-12-09 19:25:32,830 INFO L226 Difference]: Without dead ends: 835 [2018-12-09 19:25:32,831 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-09 19:25:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-12-09 19:25:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 765. [2018-12-09 19:25:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-09 19:25:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1166 transitions. [2018-12-09 19:25:32,854 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1166 transitions. Word has length 139 [2018-12-09 19:25:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:32,855 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1166 transitions. [2018-12-09 19:25:32,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1166 transitions. [2018-12-09 19:25:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 19:25:32,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:32,855 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, 1] [2018-12-09 19:25:32,855 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:32,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2007680338, now seen corresponding path program 1 times [2018-12-09 19:25:32,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:32,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:32,888 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-09 19:25:32,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:32,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:32,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:32,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:32,889 INFO L87 Difference]: Start difference. First operand 765 states and 1166 transitions. Second operand 4 states. [2018-12-09 19:25:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:33,059 INFO L93 Difference]: Finished difference Result 1535 states and 2346 transitions. [2018-12-09 19:25:33,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:33,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-09 19:25:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:33,061 INFO L225 Difference]: With dead ends: 1535 [2018-12-09 19:25:33,061 INFO L226 Difference]: Without dead ends: 795 [2018-12-09 19:25:33,062 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-09 19:25:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-12-09 19:25:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 765. [2018-12-09 19:25:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-12-09 19:25:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1164 transitions. [2018-12-09 19:25:33,086 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1164 transitions. Word has length 140 [2018-12-09 19:25:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:33,087 INFO L480 AbstractCegarLoop]: Abstraction has 765 states and 1164 transitions. [2018-12-09 19:25:33,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1164 transitions. [2018-12-09 19:25:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 19:25:33,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:33,088 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, 1] [2018-12-09 19:25:33,088 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:33,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash 830044911, now seen corresponding path program 1 times [2018-12-09 19:25:33,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:33,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:33,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:33,125 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-09 19:25:33,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:33,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:33,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:33,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:33,126 INFO L87 Difference]: Start difference. First operand 765 states and 1164 transitions. Second operand 4 states. [2018-12-09 19:25:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:33,392 INFO L93 Difference]: Finished difference Result 1711 states and 2614 transitions. [2018-12-09 19:25:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:33,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-09 19:25:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:33,394 INFO L225 Difference]: With dead ends: 1711 [2018-12-09 19:25:33,394 INFO L226 Difference]: Without dead ends: 971 [2018-12-09 19:25:33,394 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-09 19:25:33,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-09 19:25:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 789. [2018-12-09 19:25:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-12-09 19:25:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1198 transitions. [2018-12-09 19:25:33,420 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1198 transitions. Word has length 140 [2018-12-09 19:25:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:33,420 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1198 transitions. [2018-12-09 19:25:33,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1198 transitions. [2018-12-09 19:25:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 19:25:33,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:33,421 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, 1] [2018-12-09 19:25:33,421 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:33,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 386893270, now seen corresponding path program 1 times [2018-12-09 19:25:33,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:33,450 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-09 19:25:33,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:33,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:33,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:33,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:33,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:33,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:33,451 INFO L87 Difference]: Start difference. First operand 789 states and 1198 transitions. Second operand 4 states. [2018-12-09 19:25:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:33,688 INFO L93 Difference]: Finished difference Result 1735 states and 2646 transitions. [2018-12-09 19:25:33,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:33,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-09 19:25:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:33,690 INFO L225 Difference]: With dead ends: 1735 [2018-12-09 19:25:33,691 INFO L226 Difference]: Without dead ends: 971 [2018-12-09 19:25:33,692 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-09 19:25:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-09 19:25:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 791. [2018-12-09 19:25:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-12-09 19:25:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1200 transitions. [2018-12-09 19:25:33,720 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1200 transitions. Word has length 141 [2018-12-09 19:25:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:33,720 INFO L480 AbstractCegarLoop]: Abstraction has 791 states and 1200 transitions. [2018-12-09 19:25:33,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1200 transitions. [2018-12-09 19:25:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 19:25:33,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:33,721 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, 1] [2018-12-09 19:25:33,721 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:33,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:33,721 INFO L82 PathProgramCache]: Analyzing trace with hash -504702508, now seen corresponding path program 1 times [2018-12-09 19:25:33,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:33,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:33,761 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-09 19:25:33,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:33,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:33,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:33,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:33,761 INFO L87 Difference]: Start difference. First operand 791 states and 1200 transitions. Second operand 4 states. [2018-12-09 19:25:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:34,025 INFO L93 Difference]: Finished difference Result 1737 states and 2646 transitions. [2018-12-09 19:25:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:34,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-09 19:25:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:34,027 INFO L225 Difference]: With dead ends: 1737 [2018-12-09 19:25:34,027 INFO L226 Difference]: Without dead ends: 971 [2018-12-09 19:25:34,028 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-09 19:25:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-09 19:25:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 793. [2018-12-09 19:25:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2018-12-09 19:25:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2018-12-09 19:25:34,055 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 142 [2018-12-09 19:25:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:34,055 INFO L480 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2018-12-09 19:25:34,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2018-12-09 19:25:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 19:25:34,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:34,056 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, 1] [2018-12-09 19:25:34,056 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:34,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1881802651, now seen corresponding path program 1 times [2018-12-09 19:25:34,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:34,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:34,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:34,092 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-09 19:25:34,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:34,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:34,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:34,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:34,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:34,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:34,093 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 4 states. [2018-12-09 19:25:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:34,338 INFO L93 Difference]: Finished difference Result 1719 states and 2622 transitions. [2018-12-09 19:25:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:34,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-09 19:25:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:34,340 INFO L225 Difference]: With dead ends: 1719 [2018-12-09 19:25:34,340 INFO L226 Difference]: Without dead ends: 951 [2018-12-09 19:25:34,341 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-09 19:25:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-09 19:25:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 795. [2018-12-09 19:25:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-12-09 19:25:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1204 transitions. [2018-12-09 19:25:34,369 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1204 transitions. Word has length 143 [2018-12-09 19:25:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:34,369 INFO L480 AbstractCegarLoop]: Abstraction has 795 states and 1204 transitions. [2018-12-09 19:25:34,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1204 transitions. [2018-12-09 19:25:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 19:25:34,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:34,370 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, 1, 1] [2018-12-09 19:25:34,370 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:34,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:34,371 INFO L82 PathProgramCache]: Analyzing trace with hash 386256481, now seen corresponding path program 1 times [2018-12-09 19:25:34,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:34,401 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-09 19:25:34,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:34,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:34,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:34,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:34,401 INFO L87 Difference]: Start difference. First operand 795 states and 1204 transitions. Second operand 4 states. [2018-12-09 19:25:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:34,674 INFO L93 Difference]: Finished difference Result 1741 states and 2646 transitions. [2018-12-09 19:25:34,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:34,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-09 19:25:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:34,676 INFO L225 Difference]: With dead ends: 1741 [2018-12-09 19:25:34,676 INFO L226 Difference]: Without dead ends: 971 [2018-12-09 19:25:34,677 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-09 19:25:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-09 19:25:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 795. [2018-12-09 19:25:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-12-09 19:25:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1202 transitions. [2018-12-09 19:25:34,704 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1202 transitions. Word has length 148 [2018-12-09 19:25:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:34,704 INFO L480 AbstractCegarLoop]: Abstraction has 795 states and 1202 transitions. [2018-12-09 19:25:34,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1202 transitions. [2018-12-09 19:25:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 19:25:34,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:34,705 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, 1, 1] [2018-12-09 19:25:34,705 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:34,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:34,706 INFO L82 PathProgramCache]: Analyzing trace with hash -485646172, now seen corresponding path program 1 times [2018-12-09 19:25:34,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:34,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:34,737 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-09 19:25:34,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:34,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:34,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:34,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:34,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:34,738 INFO L87 Difference]: Start difference. First operand 795 states and 1202 transitions. Second operand 4 states. [2018-12-09 19:25:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:35,044 INFO L93 Difference]: Finished difference Result 1741 states and 2642 transitions. [2018-12-09 19:25:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:35,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-09 19:25:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:35,046 INFO L225 Difference]: With dead ends: 1741 [2018-12-09 19:25:35,046 INFO L226 Difference]: Without dead ends: 971 [2018-12-09 19:25:35,047 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-09 19:25:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-09 19:25:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 795. [2018-12-09 19:25:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-12-09 19:25:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1200 transitions. [2018-12-09 19:25:35,076 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1200 transitions. Word has length 149 [2018-12-09 19:25:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:35,077 INFO L480 AbstractCegarLoop]: Abstraction has 795 states and 1200 transitions. [2018-12-09 19:25:35,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1200 transitions. [2018-12-09 19:25:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 19:25:35,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:35,077 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, 1, 1] [2018-12-09 19:25:35,077 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:35,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1783621434, now seen corresponding path program 1 times [2018-12-09 19:25:35,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:35,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:35,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:35,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:35,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:35,109 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-09 19:25:35,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:35,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:35,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:35,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:35,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:35,109 INFO L87 Difference]: Start difference. First operand 795 states and 1200 transitions. Second operand 4 states. [2018-12-09 19:25:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:35,380 INFO L93 Difference]: Finished difference Result 1741 states and 2638 transitions. [2018-12-09 19:25:35,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:35,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-09 19:25:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:35,382 INFO L225 Difference]: With dead ends: 1741 [2018-12-09 19:25:35,382 INFO L226 Difference]: Without dead ends: 971 [2018-12-09 19:25:35,383 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-09 19:25:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-09 19:25:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 795. [2018-12-09 19:25:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-12-09 19:25:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1198 transitions. [2018-12-09 19:25:35,413 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1198 transitions. Word has length 150 [2018-12-09 19:25:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:35,414 INFO L480 AbstractCegarLoop]: Abstraction has 795 states and 1198 transitions. [2018-12-09 19:25:35,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1198 transitions. [2018-12-09 19:25:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 19:25:35,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:35,415 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, 1] [2018-12-09 19:25:35,415 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:35,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:35,415 INFO L82 PathProgramCache]: Analyzing trace with hash -33795953, now seen corresponding path program 1 times [2018-12-09 19:25:35,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:35,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:35,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:35,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:35,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:35,450 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-09 19:25:35,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:35,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:35,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:35,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:35,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:35,451 INFO L87 Difference]: Start difference. First operand 795 states and 1198 transitions. Second operand 4 states. [2018-12-09 19:25:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:35,715 INFO L93 Difference]: Finished difference Result 1721 states and 2610 transitions. [2018-12-09 19:25:35,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:35,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-09 19:25:35,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:35,716 INFO L225 Difference]: With dead ends: 1721 [2018-12-09 19:25:35,716 INFO L226 Difference]: Without dead ends: 951 [2018-12-09 19:25:35,717 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-09 19:25:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-09 19:25:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 821. [2018-12-09 19:25:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-09 19:25:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1248 transitions. [2018-12-09 19:25:35,750 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1248 transitions. Word has length 150 [2018-12-09 19:25:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:35,750 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1248 transitions. [2018-12-09 19:25:35,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1248 transitions. [2018-12-09 19:25:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 19:25:35,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:35,751 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, 1, 1] [2018-12-09 19:25:35,751 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:35,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash 890021609, now seen corresponding path program 1 times [2018-12-09 19:25:35,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:35,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:35,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:35,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:35,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:35,784 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-09 19:25:35,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:35,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:35,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:35,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:35,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:35,785 INFO L87 Difference]: Start difference. First operand 821 states and 1248 transitions. Second operand 4 states. [2018-12-09 19:25:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:36,078 INFO L93 Difference]: Finished difference Result 1747 states and 2658 transitions. [2018-12-09 19:25:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:36,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-09 19:25:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:36,079 INFO L225 Difference]: With dead ends: 1747 [2018-12-09 19:25:36,080 INFO L226 Difference]: Without dead ends: 951 [2018-12-09 19:25:36,080 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-09 19:25:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-09 19:25:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 821. [2018-12-09 19:25:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-09 19:25:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1246 transitions. [2018-12-09 19:25:36,113 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1246 transitions. Word has length 151 [2018-12-09 19:25:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:36,113 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1246 transitions. [2018-12-09 19:25:36,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1246 transitions. [2018-12-09 19:25:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 19:25:36,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:36,114 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, 1] [2018-12-09 19:25:36,114 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:36,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:36,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2046915658, now seen corresponding path program 1 times [2018-12-09 19:25:36,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:36,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:36,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:36,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:36,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:36,154 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-09 19:25:36,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:36,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:36,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:36,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:36,154 INFO L87 Difference]: Start difference. First operand 821 states and 1246 transitions. Second operand 4 states. [2018-12-09 19:25:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:36,389 INFO L93 Difference]: Finished difference Result 1731 states and 2628 transitions. [2018-12-09 19:25:36,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:36,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-09 19:25:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:36,391 INFO L225 Difference]: With dead ends: 1731 [2018-12-09 19:25:36,391 INFO L226 Difference]: Without dead ends: 935 [2018-12-09 19:25:36,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-09 19:25:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-09 19:25:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 823. [2018-12-09 19:25:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-09 19:25:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1248 transitions. [2018-12-09 19:25:36,447 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1248 transitions. Word has length 151 [2018-12-09 19:25:36,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:36,447 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1248 transitions. [2018-12-09 19:25:36,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1248 transitions. [2018-12-09 19:25:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 19:25:36,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:36,448 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, 1] [2018-12-09 19:25:36,448 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:36,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash 341011864, now seen corresponding path program 1 times [2018-12-09 19:25:36,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:36,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:36,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:36,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:36,479 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-09 19:25:36,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:36,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:36,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:36,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:36,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:36,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:36,480 INFO L87 Difference]: Start difference. First operand 823 states and 1248 transitions. Second operand 4 states. [2018-12-09 19:25:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:36,709 INFO L93 Difference]: Finished difference Result 1733 states and 2628 transitions. [2018-12-09 19:25:36,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:36,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 19:25:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:36,710 INFO L225 Difference]: With dead ends: 1733 [2018-12-09 19:25:36,710 INFO L226 Difference]: Without dead ends: 935 [2018-12-09 19:25:36,711 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-09 19:25:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-09 19:25:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 823. [2018-12-09 19:25:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-09 19:25:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1246 transitions. [2018-12-09 19:25:36,742 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1246 transitions. Word has length 153 [2018-12-09 19:25:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:36,742 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1246 transitions. [2018-12-09 19:25:36,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1246 transitions. [2018-12-09 19:25:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 19:25:36,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:36,743 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, 1] [2018-12-09 19:25:36,743 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:36,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:36,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1039392559, now seen corresponding path program 1 times [2018-12-09 19:25:36,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:36,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:36,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:36,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:36,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:36,784 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-09 19:25:36,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:36,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:36,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:36,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:36,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:36,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:36,784 INFO L87 Difference]: Start difference. First operand 823 states and 1246 transitions. Second operand 4 states. [2018-12-09 19:25:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:37,012 INFO L93 Difference]: Finished difference Result 1729 states and 2620 transitions. [2018-12-09 19:25:37,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:37,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 19:25:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:37,014 INFO L225 Difference]: With dead ends: 1729 [2018-12-09 19:25:37,014 INFO L226 Difference]: Without dead ends: 931 [2018-12-09 19:25:37,015 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-09 19:25:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2018-12-09 19:25:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 823. [2018-12-09 19:25:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-09 19:25:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1244 transitions. [2018-12-09 19:25:37,048 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1244 transitions. Word has length 154 [2018-12-09 19:25:37,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:37,048 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1244 transitions. [2018-12-09 19:25:37,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1244 transitions. [2018-12-09 19:25:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 19:25:37,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:37,049 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, 1] [2018-12-09 19:25:37,049 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:37,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:37,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1740372305, now seen corresponding path program 1 times [2018-12-09 19:25:37,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:37,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:37,095 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-09 19:25:37,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:37,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:37,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:37,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:37,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:37,096 INFO L87 Difference]: Start difference. First operand 823 states and 1244 transitions. Second operand 4 states. [2018-12-09 19:25:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:37,347 INFO L93 Difference]: Finished difference Result 1723 states and 2608 transitions. [2018-12-09 19:25:37,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:37,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 19:25:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:37,349 INFO L225 Difference]: With dead ends: 1723 [2018-12-09 19:25:37,349 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:25:37,350 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-09 19:25:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:25:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 829. [2018-12-09 19:25:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-09 19:25:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1254 transitions. [2018-12-09 19:25:37,383 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1254 transitions. Word has length 154 [2018-12-09 19:25:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:37,383 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1254 transitions. [2018-12-09 19:25:37,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1254 transitions. [2018-12-09 19:25:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 19:25:37,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:37,384 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, 1] [2018-12-09 19:25:37,384 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:37,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:37,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1415009213, now seen corresponding path program 1 times [2018-12-09 19:25:37,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:37,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:37,415 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-09 19:25:37,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:37,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:37,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:37,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:37,415 INFO L87 Difference]: Start difference. First operand 829 states and 1254 transitions. Second operand 4 states. [2018-12-09 19:25:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:37,636 INFO L93 Difference]: Finished difference Result 1703 states and 2576 transitions. [2018-12-09 19:25:37,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:37,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 19:25:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:37,637 INFO L225 Difference]: With dead ends: 1703 [2018-12-09 19:25:37,637 INFO L226 Difference]: Without dead ends: 899 [2018-12-09 19:25:37,638 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-09 19:25:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-09 19:25:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 829. [2018-12-09 19:25:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-09 19:25:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1252 transitions. [2018-12-09 19:25:37,672 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1252 transitions. Word has length 154 [2018-12-09 19:25:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:37,672 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1252 transitions. [2018-12-09 19:25:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1252 transitions. [2018-12-09 19:25:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 19:25:37,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:37,673 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, 1] [2018-12-09 19:25:37,673 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:37,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash -490307838, now seen corresponding path program 1 times [2018-12-09 19:25:37,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:37,706 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-09 19:25:37,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:37,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:37,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:37,707 INFO L87 Difference]: Start difference. First operand 829 states and 1252 transitions. Second operand 4 states. [2018-12-09 19:25:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:37,938 INFO L93 Difference]: Finished difference Result 1703 states and 2572 transitions. [2018-12-09 19:25:37,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:37,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-09 19:25:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:37,939 INFO L225 Difference]: With dead ends: 1703 [2018-12-09 19:25:37,939 INFO L226 Difference]: Without dead ends: 899 [2018-12-09 19:25:37,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-09 19:25:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-09 19:25:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 829. [2018-12-09 19:25:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-09 19:25:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1250 transitions. [2018-12-09 19:25:37,973 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1250 transitions. Word has length 155 [2018-12-09 19:25:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:37,973 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1250 transitions. [2018-12-09 19:25:37,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1250 transitions. [2018-12-09 19:25:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 19:25:37,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:37,974 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, 1] [2018-12-09 19:25:37,974 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:37,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:37,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133080, now seen corresponding path program 1 times [2018-12-09 19:25:37,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:37,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:37,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:38,009 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-09 19:25:38,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:38,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:38,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:38,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:38,010 INFO L87 Difference]: Start difference. First operand 829 states and 1250 transitions. Second operand 4 states. [2018-12-09 19:25:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:38,263 INFO L93 Difference]: Finished difference Result 1703 states and 2568 transitions. [2018-12-09 19:25:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:38,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 19:25:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:38,265 INFO L225 Difference]: With dead ends: 1703 [2018-12-09 19:25:38,265 INFO L226 Difference]: Without dead ends: 899 [2018-12-09 19:25:38,266 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-09 19:25:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-12-09 19:25:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 829. [2018-12-09 19:25:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-09 19:25:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1248 transitions. [2018-12-09 19:25:38,303 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1248 transitions. Word has length 156 [2018-12-09 19:25:38,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:38,303 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1248 transitions. [2018-12-09 19:25:38,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1248 transitions. [2018-12-09 19:25:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 19:25:38,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:38,304 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, 1] [2018-12-09 19:25:38,305 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:38,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:38,305 INFO L82 PathProgramCache]: Analyzing trace with hash 166874590, now seen corresponding path program 1 times [2018-12-09 19:25:38,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:38,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:38,353 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-09 19:25:38,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:38,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:38,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:38,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:38,354 INFO L87 Difference]: Start difference. First operand 829 states and 1248 transitions. Second operand 4 states. [2018-12-09 19:25:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:38,639 INFO L93 Difference]: Finished difference Result 1729 states and 2604 transitions. [2018-12-09 19:25:38,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:38,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-09 19:25:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:38,641 INFO L225 Difference]: With dead ends: 1729 [2018-12-09 19:25:38,641 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:25:38,642 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-09 19:25:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:25:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 831. [2018-12-09 19:25:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-09 19:25:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1250 transitions. [2018-12-09 19:25:38,692 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1250 transitions. Word has length 157 [2018-12-09 19:25:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:38,692 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1250 transitions. [2018-12-09 19:25:38,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1250 transitions. [2018-12-09 19:25:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 19:25:38,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:38,693 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, 1] [2018-12-09 19:25:38,693 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:38,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash 705127879, now seen corresponding path program 1 times [2018-12-09 19:25:38,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:38,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:38,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:38,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:38,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:38,726 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-09 19:25:38,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:38,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:38,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:38,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:38,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:38,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:38,726 INFO L87 Difference]: Start difference. First operand 831 states and 1250 transitions. Second operand 4 states. [2018-12-09 19:25:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:38,983 INFO L93 Difference]: Finished difference Result 1687 states and 2544 transitions. [2018-12-09 19:25:38,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:38,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-09 19:25:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:38,984 INFO L225 Difference]: With dead ends: 1687 [2018-12-09 19:25:38,984 INFO L226 Difference]: Without dead ends: 881 [2018-12-09 19:25:38,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-09 19:25:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-12-09 19:25:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 831. [2018-12-09 19:25:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-09 19:25:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1248 transitions. [2018-12-09 19:25:39,025 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1248 transitions. Word has length 157 [2018-12-09 19:25:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:39,026 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1248 transitions. [2018-12-09 19:25:39,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1248 transitions. [2018-12-09 19:25:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 19:25:39,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:39,027 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, 1, 1] [2018-12-09 19:25:39,027 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:39,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -665551487, now seen corresponding path program 1 times [2018-12-09 19:25:39,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:39,079 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-09 19:25:39,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:39,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:39,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:39,080 INFO L87 Difference]: Start difference. First operand 831 states and 1248 transitions. Second operand 4 states. [2018-12-09 19:25:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:39,341 INFO L93 Difference]: Finished difference Result 1757 states and 2638 transitions. [2018-12-09 19:25:39,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:39,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-09 19:25:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:39,343 INFO L225 Difference]: With dead ends: 1757 [2018-12-09 19:25:39,343 INFO L226 Difference]: Without dead ends: 951 [2018-12-09 19:25:39,343 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-09 19:25:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-09 19:25:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 831. [2018-12-09 19:25:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-09 19:25:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1246 transitions. [2018-12-09 19:25:39,379 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1246 transitions. Word has length 158 [2018-12-09 19:25:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:39,379 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1246 transitions. [2018-12-09 19:25:39,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1246 transitions. [2018-12-09 19:25:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 19:25:39,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:39,380 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, 1] [2018-12-09 19:25:39,380 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:39,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1562967012, now seen corresponding path program 1 times [2018-12-09 19:25:39,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:39,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:39,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:39,427 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-09 19:25:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:39,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:39,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:39,428 INFO L87 Difference]: Start difference. First operand 831 states and 1246 transitions. Second operand 4 states. [2018-12-09 19:25:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:39,647 INFO L93 Difference]: Finished difference Result 1719 states and 2580 transitions. [2018-12-09 19:25:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:39,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-09 19:25:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:39,648 INFO L225 Difference]: With dead ends: 1719 [2018-12-09 19:25:39,648 INFO L226 Difference]: Without dead ends: 913 [2018-12-09 19:25:39,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-12-09 19:25:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 833. [2018-12-09 19:25:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-12-09 19:25:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1248 transitions. [2018-12-09 19:25:39,686 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1248 transitions. Word has length 158 [2018-12-09 19:25:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:39,686 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1248 transitions. [2018-12-09 19:25:39,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1248 transitions. [2018-12-09 19:25:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 19:25:39,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:39,687 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, 1] [2018-12-09 19:25:39,687 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:39,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash 790763261, now seen corresponding path program 1 times [2018-12-09 19:25:39,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:39,721 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-09 19:25:39,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:39,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:39,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:39,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:39,721 INFO L87 Difference]: Start difference. First operand 833 states and 1248 transitions. Second operand 4 states. [2018-12-09 19:25:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:39,942 INFO L93 Difference]: Finished difference Result 1721 states and 2580 transitions. [2018-12-09 19:25:39,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:39,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-09 19:25:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:39,943 INFO L225 Difference]: With dead ends: 1721 [2018-12-09 19:25:39,943 INFO L226 Difference]: Without dead ends: 913 [2018-12-09 19:25:39,944 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-09 19:25:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-12-09 19:25:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 835. [2018-12-09 19:25:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-12-09 19:25:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1250 transitions. [2018-12-09 19:25:39,980 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1250 transitions. Word has length 158 [2018-12-09 19:25:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:39,980 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1250 transitions. [2018-12-09 19:25:39,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1250 transitions. [2018-12-09 19:25:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 19:25:39,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:39,981 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, 1, 1] [2018-12-09 19:25:39,981 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:39,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:39,982 INFO L82 PathProgramCache]: Analyzing trace with hash -156500732, now seen corresponding path program 1 times [2018-12-09 19:25:39,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:39,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:39,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:39,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:40,028 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-09 19:25:40,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:40,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:40,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:40,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:40,029 INFO L87 Difference]: Start difference. First operand 835 states and 1250 transitions. Second operand 4 states. [2018-12-09 19:25:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:40,296 INFO L93 Difference]: Finished difference Result 1745 states and 2608 transitions. [2018-12-09 19:25:40,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:40,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 19:25:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:40,297 INFO L225 Difference]: With dead ends: 1745 [2018-12-09 19:25:40,298 INFO L226 Difference]: Without dead ends: 935 [2018-12-09 19:25:40,298 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-09 19:25:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-09 19:25:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 835. [2018-12-09 19:25:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-12-09 19:25:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1248 transitions. [2018-12-09 19:25:40,337 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1248 transitions. Word has length 159 [2018-12-09 19:25:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:40,337 INFO L480 AbstractCegarLoop]: Abstraction has 835 states and 1248 transitions. [2018-12-09 19:25:40,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1248 transitions. [2018-12-09 19:25:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 19:25:40,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:40,339 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, 1] [2018-12-09 19:25:40,339 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:40,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:40,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2036988961, now seen corresponding path program 1 times [2018-12-09 19:25:40,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:40,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:40,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:40,377 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-09 19:25:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:40,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:40,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:40,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:40,377 INFO L87 Difference]: Start difference. First operand 835 states and 1248 transitions. Second operand 4 states. [2018-12-09 19:25:40,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:40,647 INFO L93 Difference]: Finished difference Result 1717 states and 2569 transitions. [2018-12-09 19:25:40,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:40,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 19:25:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:40,648 INFO L225 Difference]: With dead ends: 1717 [2018-12-09 19:25:40,648 INFO L226 Difference]: Without dead ends: 907 [2018-12-09 19:25:40,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-12-09 19:25:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 837. [2018-12-09 19:25:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-09 19:25:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1250 transitions. [2018-12-09 19:25:40,690 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1250 transitions. Word has length 159 [2018-12-09 19:25:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:40,690 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1250 transitions. [2018-12-09 19:25:40,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1250 transitions. [2018-12-09 19:25:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 19:25:40,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:40,691 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, 1] [2018-12-09 19:25:40,691 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:40,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash 349586309, now seen corresponding path program 1 times [2018-12-09 19:25:40,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:40,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:40,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:40,731 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-09 19:25:40,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:40,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:40,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:40,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:40,732 INFO L87 Difference]: Start difference. First operand 837 states and 1250 transitions. Second operand 4 states. [2018-12-09 19:25:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:40,957 INFO L93 Difference]: Finished difference Result 1719 states and 2569 transitions. [2018-12-09 19:25:40,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:40,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-09 19:25:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:40,958 INFO L225 Difference]: With dead ends: 1719 [2018-12-09 19:25:40,958 INFO L226 Difference]: Without dead ends: 907 [2018-12-09 19:25:40,959 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-09 19:25:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-12-09 19:25:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 839. [2018-12-09 19:25:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-12-09 19:25:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1252 transitions. [2018-12-09 19:25:40,997 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1252 transitions. Word has length 160 [2018-12-09 19:25:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:40,997 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 1252 transitions. [2018-12-09 19:25:40,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1252 transitions. [2018-12-09 19:25:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 19:25:40,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:40,998 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, 1, 1] [2018-12-09 19:25:40,998 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:40,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash 258589542, now seen corresponding path program 1 times [2018-12-09 19:25:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:40,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:41,029 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-09 19:25:41,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:41,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:41,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:41,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:41,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:41,030 INFO L87 Difference]: Start difference. First operand 839 states and 1252 transitions. Second operand 4 states. [2018-12-09 19:25:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:41,289 INFO L93 Difference]: Finished difference Result 1749 states and 2604 transitions. [2018-12-09 19:25:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:41,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-09 19:25:41,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:41,290 INFO L225 Difference]: With dead ends: 1749 [2018-12-09 19:25:41,290 INFO L226 Difference]: Without dead ends: 935 [2018-12-09 19:25:41,291 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-09 19:25:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-09 19:25:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 839. [2018-12-09 19:25:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-12-09 19:25:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1250 transitions. [2018-12-09 19:25:41,330 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1250 transitions. Word has length 161 [2018-12-09 19:25:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:41,330 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 1250 transitions. [2018-12-09 19:25:41,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1250 transitions. [2018-12-09 19:25:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 19:25:41,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:41,331 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, 1] [2018-12-09 19:25:41,331 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:41,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:41,331 INFO L82 PathProgramCache]: Analyzing trace with hash 851729223, now seen corresponding path program 1 times [2018-12-09 19:25:41,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:41,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:41,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:41,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:41,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:41,367 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-09 19:25:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:41,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:41,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:41,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:41,368 INFO L87 Difference]: Start difference. First operand 839 states and 1250 transitions. Second operand 4 states. [2018-12-09 19:25:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:41,617 INFO L93 Difference]: Finished difference Result 1715 states and 2558 transitions. [2018-12-09 19:25:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:41,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-09 19:25:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:41,618 INFO L225 Difference]: With dead ends: 1715 [2018-12-09 19:25:41,618 INFO L226 Difference]: Without dead ends: 901 [2018-12-09 19:25:41,619 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-09 19:25:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-12-09 19:25:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 841. [2018-12-09 19:25:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-12-09 19:25:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1252 transitions. [2018-12-09 19:25:41,660 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1252 transitions. Word has length 161 [2018-12-09 19:25:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:41,660 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1252 transitions. [2018-12-09 19:25:41,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1252 transitions. [2018-12-09 19:25:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 19:25:41,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:41,661 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, 1, 1] [2018-12-09 19:25:41,661 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:41,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash 700482755, now seen corresponding path program 1 times [2018-12-09 19:25:41,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:41,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:41,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:41,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:41,698 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-09 19:25:41,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:41,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:41,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:41,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:41,699 INFO L87 Difference]: Start difference. First operand 841 states and 1252 transitions. Second operand 4 states. [2018-12-09 19:25:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:41,948 INFO L93 Difference]: Finished difference Result 1747 states and 2596 transitions. [2018-12-09 19:25:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:41,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-09 19:25:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:41,950 INFO L225 Difference]: With dead ends: 1747 [2018-12-09 19:25:41,950 INFO L226 Difference]: Without dead ends: 931 [2018-12-09 19:25:41,950 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-09 19:25:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2018-12-09 19:25:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 841. [2018-12-09 19:25:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-12-09 19:25:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1250 transitions. [2018-12-09 19:25:41,990 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1250 transitions. Word has length 162 [2018-12-09 19:25:41,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:41,990 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1250 transitions. [2018-12-09 19:25:41,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1250 transitions. [2018-12-09 19:25:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 19:25:41,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:41,991 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, 1, 1] [2018-12-09 19:25:41,991 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:41,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash -814719677, now seen corresponding path program 1 times [2018-12-09 19:25:41,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:41,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:41,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:41,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:41,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:42,031 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-09 19:25:42,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:42,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:42,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:42,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:42,032 INFO L87 Difference]: Start difference. First operand 841 states and 1250 transitions. Second operand 4 states. [2018-12-09 19:25:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:42,268 INFO L93 Difference]: Finished difference Result 1741 states and 2584 transitions. [2018-12-09 19:25:42,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:42,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-09 19:25:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:42,270 INFO L225 Difference]: With dead ends: 1741 [2018-12-09 19:25:42,270 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:25:42,271 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-09 19:25:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:25:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 841. [2018-12-09 19:25:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-12-09 19:25:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1248 transitions. [2018-12-09 19:25:42,313 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1248 transitions. Word has length 162 [2018-12-09 19:25:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:42,313 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1248 transitions. [2018-12-09 19:25:42,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1248 transitions. [2018-12-09 19:25:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 19:25:42,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:42,314 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] [2018-12-09 19:25:42,314 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:42,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1789716707, now seen corresponding path program 1 times [2018-12-09 19:25:42,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:42,363 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-09 19:25:42,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:42,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:42,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:42,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:42,364 INFO L87 Difference]: Start difference. First operand 841 states and 1248 transitions. Second operand 4 states. [2018-12-09 19:25:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:42,635 INFO L93 Difference]: Finished difference Result 1791 states and 2676 transitions. [2018-12-09 19:25:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:42,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-09 19:25:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:42,637 INFO L225 Difference]: With dead ends: 1791 [2018-12-09 19:25:42,637 INFO L226 Difference]: Without dead ends: 975 [2018-12-09 19:25:42,637 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-09 19:25:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-09 19:25:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2018-12-09 19:25:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1354 transitions. [2018-12-09 19:25:42,681 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1354 transitions. Word has length 164 [2018-12-09 19:25:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:42,681 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1354 transitions. [2018-12-09 19:25:42,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1354 transitions. [2018-12-09 19:25:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 19:25:42,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:42,682 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, 1, 1] [2018-12-09 19:25:42,682 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:42,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1127025836, now seen corresponding path program 1 times [2018-12-09 19:25:42,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:42,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:42,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:42,719 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-09 19:25:42,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:42,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:42,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:42,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:42,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:42,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:42,719 INFO L87 Difference]: Start difference. First operand 901 states and 1354 transitions. Second operand 4 states. [2018-12-09 19:25:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:42,984 INFO L93 Difference]: Finished difference Result 1861 states and 2792 transitions. [2018-12-09 19:25:42,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:42,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-09 19:25:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:42,985 INFO L225 Difference]: With dead ends: 1861 [2018-12-09 19:25:42,985 INFO L226 Difference]: Without dead ends: 985 [2018-12-09 19:25:42,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-09 19:25:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-12-09 19:25:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 901. [2018-12-09 19:25:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1352 transitions. [2018-12-09 19:25:43,028 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1352 transitions. Word has length 165 [2018-12-09 19:25:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:43,028 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1352 transitions. [2018-12-09 19:25:43,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1352 transitions. [2018-12-09 19:25:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-09 19:25:43,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:43,029 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, 1, 1] [2018-12-09 19:25:43,029 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:43,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1863049458, now seen corresponding path program 1 times [2018-12-09 19:25:43,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:43,064 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-09 19:25:43,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:43,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:43,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:43,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:43,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:43,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:43,065 INFO L87 Difference]: Start difference. First operand 901 states and 1352 transitions. Second operand 4 states. [2018-12-09 19:25:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:43,317 INFO L93 Difference]: Finished difference Result 1849 states and 2772 transitions. [2018-12-09 19:25:43,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:43,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-09 19:25:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:43,319 INFO L225 Difference]: With dead ends: 1849 [2018-12-09 19:25:43,319 INFO L226 Difference]: Without dead ends: 973 [2018-12-09 19:25:43,319 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-09 19:25:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2018-12-09 19:25:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 901. [2018-12-09 19:25:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1350 transitions. [2018-12-09 19:25:43,361 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1350 transitions. Word has length 166 [2018-12-09 19:25:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:43,361 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1350 transitions. [2018-12-09 19:25:43,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1350 transitions. [2018-12-09 19:25:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-09 19:25:43,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:43,362 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 19:25:43,362 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:43,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash 490680815, now seen corresponding path program 1 times [2018-12-09 19:25:43,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:43,403 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-09 19:25:43,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:43,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:43,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:43,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:43,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:43,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:43,404 INFO L87 Difference]: Start difference. First operand 901 states and 1350 transitions. Second operand 4 states. [2018-12-09 19:25:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:43,659 INFO L93 Difference]: Finished difference Result 1849 states and 2768 transitions. [2018-12-09 19:25:43,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:43,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-09 19:25:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:43,660 INFO L225 Difference]: With dead ends: 1849 [2018-12-09 19:25:43,660 INFO L226 Difference]: Without dead ends: 973 [2018-12-09 19:25:43,661 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-09 19:25:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2018-12-09 19:25:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 901. [2018-12-09 19:25:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1348 transitions. [2018-12-09 19:25:43,704 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1348 transitions. Word has length 166 [2018-12-09 19:25:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:43,704 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1348 transitions. [2018-12-09 19:25:43,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1348 transitions. [2018-12-09 19:25:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 19:25:43,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:43,705 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, 1, 1] [2018-12-09 19:25:43,705 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:43,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1545357101, now seen corresponding path program 1 times [2018-12-09 19:25:43,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:43,751 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-09 19:25:43,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:43,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:43,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:43,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:43,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:43,752 INFO L87 Difference]: Start difference. First operand 901 states and 1348 transitions. Second operand 4 states. [2018-12-09 19:25:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:44,001 INFO L93 Difference]: Finished difference Result 1843 states and 2757 transitions. [2018-12-09 19:25:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:44,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 19:25:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:44,002 INFO L225 Difference]: With dead ends: 1843 [2018-12-09 19:25:44,002 INFO L226 Difference]: Without dead ends: 967 [2018-12-09 19:25:44,003 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-09 19:25:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-09 19:25:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 901. [2018-12-09 19:25:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1346 transitions. [2018-12-09 19:25:44,058 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1346 transitions. Word has length 167 [2018-12-09 19:25:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:44,058 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1346 transitions. [2018-12-09 19:25:44,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1346 transitions. [2018-12-09 19:25:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 19:25:44,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:44,059 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, 1] [2018-12-09 19:25:44,059 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:44,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash 613286805, now seen corresponding path program 1 times [2018-12-09 19:25:44,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:44,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,095 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-09 19:25:44,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:44,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:44,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:44,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:44,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:44,096 INFO L87 Difference]: Start difference. First operand 901 states and 1346 transitions. Second operand 4 states. [2018-12-09 19:25:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:44,324 INFO L93 Difference]: Finished difference Result 1837 states and 2746 transitions. [2018-12-09 19:25:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:44,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 19:25:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:44,325 INFO L225 Difference]: With dead ends: 1837 [2018-12-09 19:25:44,326 INFO L226 Difference]: Without dead ends: 961 [2018-12-09 19:25:44,326 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-09 19:25:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-09 19:25:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 901. [2018-12-09 19:25:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1344 transitions. [2018-12-09 19:25:44,370 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1344 transitions. Word has length 167 [2018-12-09 19:25:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:44,370 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1344 transitions. [2018-12-09 19:25:44,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1344 transitions. [2018-12-09 19:25:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 19:25:44,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:44,371 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, 1] [2018-12-09 19:25:44,371 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:44,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1860306116, now seen corresponding path program 1 times [2018-12-09 19:25:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,403 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-09 19:25:44,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:44,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:44,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:44,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:44,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:44,403 INFO L87 Difference]: Start difference. First operand 901 states and 1344 transitions. Second operand 4 states. [2018-12-09 19:25:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:44,690 INFO L93 Difference]: Finished difference Result 1857 states and 2768 transitions. [2018-12-09 19:25:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:44,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 19:25:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:44,691 INFO L225 Difference]: With dead ends: 1857 [2018-12-09 19:25:44,691 INFO L226 Difference]: Without dead ends: 981 [2018-12-09 19:25:44,692 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-09 19:25:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-12-09 19:25:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 901. [2018-12-09 19:25:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1342 transitions. [2018-12-09 19:25:44,738 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1342 transitions. Word has length 167 [2018-12-09 19:25:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:44,738 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1342 transitions. [2018-12-09 19:25:44,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1342 transitions. [2018-12-09 19:25:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 19:25:44,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:44,739 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, 1, 1] [2018-12-09 19:25:44,739 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:44,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -266835465, now seen corresponding path program 1 times [2018-12-09 19:25:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:44,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:44,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,776 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-09 19:25:44,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:44,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:44,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:44,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:44,777 INFO L87 Difference]: Start difference. First operand 901 states and 1342 transitions. Second operand 4 states. [2018-12-09 19:25:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:45,024 INFO L93 Difference]: Finished difference Result 1843 states and 2745 transitions. [2018-12-09 19:25:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:45,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-09 19:25:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:45,025 INFO L225 Difference]: With dead ends: 1843 [2018-12-09 19:25:45,025 INFO L226 Difference]: Without dead ends: 967 [2018-12-09 19:25:45,026 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-09 19:25:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-09 19:25:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 901. [2018-12-09 19:25:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1340 transitions. [2018-12-09 19:25:45,071 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1340 transitions. Word has length 168 [2018-12-09 19:25:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:45,071 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1340 transitions. [2018-12-09 19:25:45,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1340 transitions. [2018-12-09 19:25:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 19:25:45,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:45,072 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, 1] [2018-12-09 19:25:45,072 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:45,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2034747743, now seen corresponding path program 1 times [2018-12-09 19:25:45,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:45,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:45,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:45,104 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-09 19:25:45,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:45,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:45,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:45,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:45,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:45,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:45,105 INFO L87 Difference]: Start difference. First operand 901 states and 1340 transitions. Second operand 4 states. [2018-12-09 19:25:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:45,421 INFO L93 Difference]: Finished difference Result 1857 states and 2760 transitions. [2018-12-09 19:25:45,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:45,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-09 19:25:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:45,422 INFO L225 Difference]: With dead ends: 1857 [2018-12-09 19:25:45,422 INFO L226 Difference]: Without dead ends: 981 [2018-12-09 19:25:45,422 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-09 19:25:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-12-09 19:25:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 901. [2018-12-09 19:25:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:25:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1338 transitions. [2018-12-09 19:25:45,468 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1338 transitions. Word has length 168 [2018-12-09 19:25:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:45,468 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1338 transitions. [2018-12-09 19:25:45,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1338 transitions. [2018-12-09 19:25:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-09 19:25:45,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:45,469 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, 1, 1] [2018-12-09 19:25:45,469 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:45,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1077476587, now seen corresponding path program 1 times [2018-12-09 19:25:45,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:45,510 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-09 19:25:45,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:45,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:45,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:45,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:45,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:45,511 INFO L87 Difference]: Start difference. First operand 901 states and 1338 transitions. Second operand 4 states. [2018-12-09 19:25:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:45,742 INFO L93 Difference]: Finished difference Result 1837 states and 2730 transitions. [2018-12-09 19:25:45,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:45,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-09 19:25:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:45,743 INFO L225 Difference]: With dead ends: 1837 [2018-12-09 19:25:45,743 INFO L226 Difference]: Without dead ends: 961 [2018-12-09 19:25:45,744 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-09 19:25:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-09 19:25:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 885. [2018-12-09 19:25:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-09 19:25:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1318 transitions. [2018-12-09 19:25:45,790 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1318 transitions. Word has length 169 [2018-12-09 19:25:45,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:45,790 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1318 transitions. [2018-12-09 19:25:45,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1318 transitions. [2018-12-09 19:25:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-09 19:25:45,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:45,791 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, 1] [2018-12-09 19:25:45,791 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:45,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1733837417, now seen corresponding path program 1 times [2018-12-09 19:25:45,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:45,826 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-09 19:25:45,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:45,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:45,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:45,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:45,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:45,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:45,827 INFO L87 Difference]: Start difference. First operand 885 states and 1318 transitions. Second operand 4 states. [2018-12-09 19:25:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:46,083 INFO L93 Difference]: Finished difference Result 1795 states and 2680 transitions. [2018-12-09 19:25:46,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:46,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-09 19:25:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:46,084 INFO L225 Difference]: With dead ends: 1795 [2018-12-09 19:25:46,084 INFO L226 Difference]: Without dead ends: 935 [2018-12-09 19:25:46,085 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-09 19:25:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-09 19:25:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 885. [2018-12-09 19:25:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-09 19:25:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1316 transitions. [2018-12-09 19:25:46,131 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1316 transitions. Word has length 169 [2018-12-09 19:25:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:46,131 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1316 transitions. [2018-12-09 19:25:46,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1316 transitions. [2018-12-09 19:25:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 19:25:46,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:46,132 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, 1] [2018-12-09 19:25:46,132 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:46,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash -550733357, now seen corresponding path program 1 times [2018-12-09 19:25:46,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:46,169 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-09 19:25:46,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:46,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:46,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:46,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:46,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:46,169 INFO L87 Difference]: Start difference. First operand 885 states and 1316 transitions. Second operand 4 states. [2018-12-09 19:25:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:46,405 INFO L93 Difference]: Finished difference Result 1817 states and 2700 transitions. [2018-12-09 19:25:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:46,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-12-09 19:25:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:46,406 INFO L225 Difference]: With dead ends: 1817 [2018-12-09 19:25:46,406 INFO L226 Difference]: Without dead ends: 957 [2018-12-09 19:25:46,407 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-09 19:25:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-12-09 19:25:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 887. [2018-12-09 19:25:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-09 19:25:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1318 transitions. [2018-12-09 19:25:46,454 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1318 transitions. Word has length 170 [2018-12-09 19:25:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:46,454 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1318 transitions. [2018-12-09 19:25:46,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1318 transitions. [2018-12-09 19:25:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 19:25:46,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:46,455 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, 1] [2018-12-09 19:25:46,455 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:46,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -808085366, now seen corresponding path program 1 times [2018-12-09 19:25:46,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:46,490 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-09 19:25:46,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:46,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:46,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:46,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:46,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:46,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:46,491 INFO L87 Difference]: Start difference. First operand 887 states and 1318 transitions. Second operand 4 states. [2018-12-09 19:25:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:46,713 INFO L93 Difference]: Finished difference Result 1795 states and 2676 transitions. [2018-12-09 19:25:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:46,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-12-09 19:25:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:46,714 INFO L225 Difference]: With dead ends: 1795 [2018-12-09 19:25:46,714 INFO L226 Difference]: Without dead ends: 933 [2018-12-09 19:25:46,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-12-09 19:25:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 887. [2018-12-09 19:25:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-12-09 19:25:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1316 transitions. [2018-12-09 19:25:46,762 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1316 transitions. Word has length 170 [2018-12-09 19:25:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:46,762 INFO L480 AbstractCegarLoop]: Abstraction has 887 states and 1316 transitions. [2018-12-09 19:25:46,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1316 transitions. [2018-12-09 19:25:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 19:25:46,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:46,763 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, 1] [2018-12-09 19:25:46,763 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:46,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1348596858, now seen corresponding path program 1 times [2018-12-09 19:25:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:46,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:46,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:46,825 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-09 19:25:46,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:46,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:46,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:46,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:46,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:46,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:46,826 INFO L87 Difference]: Start difference. First operand 887 states and 1316 transitions. Second operand 5 states. [2018-12-09 19:25:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:47,213 INFO L93 Difference]: Finished difference Result 1907 states and 2848 transitions. [2018-12-09 19:25:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:47,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2018-12-09 19:25:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:47,214 INFO L225 Difference]: With dead ends: 1907 [2018-12-09 19:25:47,214 INFO L226 Difference]: Without dead ends: 1045 [2018-12-09 19:25:47,215 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-09 19:25:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-12-09 19:25:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 953. [2018-12-09 19:25:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-12-09 19:25:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1434 transitions. [2018-12-09 19:25:47,267 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1434 transitions. Word has length 170 [2018-12-09 19:25:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:47,268 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1434 transitions. [2018-12-09 19:25:47,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1434 transitions. [2018-12-09 19:25:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 19:25:47,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:47,269 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, 1] [2018-12-09 19:25:47,269 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:47,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2071940693, now seen corresponding path program 1 times [2018-12-09 19:25:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:47,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:47,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:47,306 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-09 19:25:47,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:47,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:47,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:47,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:47,307 INFO L87 Difference]: Start difference. First operand 953 states and 1434 transitions. Second operand 4 states. [2018-12-09 19:25:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:47,517 INFO L93 Difference]: Finished difference Result 1909 states and 2880 transitions. [2018-12-09 19:25:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:47,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-12-09 19:25:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:47,518 INFO L225 Difference]: With dead ends: 1909 [2018-12-09 19:25:47,518 INFO L226 Difference]: Without dead ends: 981 [2018-12-09 19:25:47,519 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-09 19:25:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-12-09 19:25:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 953. [2018-12-09 19:25:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-12-09 19:25:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1432 transitions. [2018-12-09 19:25:47,569 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1432 transitions. Word has length 170 [2018-12-09 19:25:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:47,569 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1432 transitions. [2018-12-09 19:25:47,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1432 transitions. [2018-12-09 19:25:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 19:25:47,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:47,570 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, 1, 1] [2018-12-09 19:25:47,570 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:47,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1065563448, now seen corresponding path program 1 times [2018-12-09 19:25:47,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:47,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:47,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:47,614 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-09 19:25:47,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:47,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:47,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:47,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:47,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:47,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:47,615 INFO L87 Difference]: Start difference. First operand 953 states and 1432 transitions. Second operand 4 states. [2018-12-09 19:25:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:47,862 INFO L93 Difference]: Finished difference Result 1955 states and 2932 transitions. [2018-12-09 19:25:47,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:47,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-09 19:25:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:47,863 INFO L225 Difference]: With dead ends: 1955 [2018-12-09 19:25:47,863 INFO L226 Difference]: Without dead ends: 1027 [2018-12-09 19:25:47,864 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-09 19:25:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-12-09 19:25:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 953. [2018-12-09 19:25:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-12-09 19:25:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1430 transitions. [2018-12-09 19:25:47,926 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1430 transitions. Word has length 177 [2018-12-09 19:25:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:47,926 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1430 transitions. [2018-12-09 19:25:47,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1430 transitions. [2018-12-09 19:25:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-09 19:25:47,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:47,927 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, 1, 1] [2018-12-09 19:25:47,927 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:47,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1347336645, now seen corresponding path program 1 times [2018-12-09 19:25:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:47,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:47,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:47,964 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-09 19:25:47,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:47,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:25:47,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:47,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:25:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:25:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:25:47,965 INFO L87 Difference]: Start difference. First operand 953 states and 1430 transitions. Second operand 4 states. [2018-12-09 19:25:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:48,188 INFO L93 Difference]: Finished difference Result 1951 states and 2924 transitions. [2018-12-09 19:25:48,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:25:48,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-09 19:25:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:48,189 INFO L225 Difference]: With dead ends: 1951 [2018-12-09 19:25:48,189 INFO L226 Difference]: Without dead ends: 1023 [2018-12-09 19:25:48,190 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-09 19:25:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-12-09 19:25:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 891. [2018-12-09 19:25:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-12-09 19:25:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1336 transitions. [2018-12-09 19:25:48,241 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1336 transitions. Word has length 178 [2018-12-09 19:25:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:48,241 INFO L480 AbstractCegarLoop]: Abstraction has 891 states and 1336 transitions. [2018-12-09 19:25:48,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:25:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1336 transitions. [2018-12-09 19:25:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 19:25:48,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:48,242 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, 1, 1, 1] [2018-12-09 19:25:48,242 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:48,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash 145640209, now seen corresponding path program 1 times [2018-12-09 19:25:48,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:48,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:48,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:48,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:48,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:48,520 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-09 19:25:48,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:48,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:48,521 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-12-09 19:25:48,522 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], [534], [549], [554], [559], [564], [569], [574], [580], [585], [587], [592], [597], [602], [607], [613], [616], [620], [641], [675], [677], [689], [692], [693], [694], [696] [2018-12-09 19:25:48,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:25:48,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:25:48,906 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:25:48,907 INFO L272 AbstractInterpreter]: Visited 85 different actions 228 times. Merged at 70 different actions 137 times. Never widened. Performed 1521 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1521 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 6 different actions. Largest state had 118 variables. [2018-12-09 19:25:48,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:48,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:25:48,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:48,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/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-09 19:25:48,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:48,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:25:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:49,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:49,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,071 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-09 19:25:49,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,089 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-09 19:25:49,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,110 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-09 19:25:49,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,145 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-09 19:25:49,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 19:25:49,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,150 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-09 19:25:49,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,155 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-09 19:25:49,155 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,163 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,167 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,172 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,182 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-09 19:25:49,182 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 19:25:49,221 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-09 19:25:49,225 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-09 19:25:49,248 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-09 19:25:49,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,262 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-09 19:25:49,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,304 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-09 19:25:49,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,314 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-09 19:25:49,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,329 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-09 19:25:49,330 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,347 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,354 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,362 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 19:25:49,385 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-09 19:25:49,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,392 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-09 19:25:49,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:25:49,415 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-09 19:25:49,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,422 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-09 19:25:49,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:25:49,441 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-09 19:25:49,443 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-09 19:25:49,461 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-09 19:25:49,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,469 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-09 19:25:49,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,481 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-09 19:25:49,482 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,512 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 19:25:49,517 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-09 19:25:49,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,524 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-09 19:25:49,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:25:49,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-09 19:25:49,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,555 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-09 19:25:49,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:25:49,577 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-09 19:25:49,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,584 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-09 19:25:49,584 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-09 19:25:49,588 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-09 19:25:49,604 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-09 19:25:49,606 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-09 19:25:49,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,622 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-09 19:25:49,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-09 19:25:49,666 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-09 19:25:49,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,677 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-09 19:25:49,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,716 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-09 19:25:49,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,728 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-09 19:25:49,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,750 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-09 19:25:49,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-09 19:25:49,776 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-09 19:25:49,778 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-09 19:25:49,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,804 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-09 19:25:49,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,812 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-09 19:25:49,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,835 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-09 19:25:49,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-09 19:25:49,863 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-09 19:25:49,865 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-09 19:25:49,865 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-09 19:25:49,867 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-09 19:25:49,883 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-09 19:25:49,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 19:25:49,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,898 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-09 19:25:49,899 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-09 19:25:49,906 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-09 19:25:49,914 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-09 19:25:49,915 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-09 19:25:49,915 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,919 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,922 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-09 19:25:49,922 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-09 19:25:49,944 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-09 19:25:49,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,947 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-09 19:25:49,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,957 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-09 19:25:49,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-09 19:25:49,990 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-09 19:25:49,991 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-09 19:25:49,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:49,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:25:49,998 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-09 19:25:49,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,003 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-09 19:25:50,004 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-09 19:25:50,165 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-09 19:25:50,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:50,213 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-09 19:25:50,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-09 19:25:50,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:25:50,216 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-09 19:25:50,217 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-09 19:25:50,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-09 19:25:50,331 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-09 19:25:50,334 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-09 19:25:50,338 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-09 19:25:50,351 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-09 19:25:50,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,357 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-09 19:25:50,358 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-09 19:25:50,358 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,359 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:25:50,363 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-09 19:25:50,365 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-09 19:25:50,365 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-09 19:25:50,374 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-09 19:25:50,376 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-09 19:25:50,382 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-09 19:25:50,383 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-09 19:25:50,385 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-09 19:25:50,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-09 19:25:50,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-12-09 19:25:50,392 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:25:50,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 19:25:50,394 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-09 19:25:50,397 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-09 19:25:50,399 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-09 19:25:50,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-12-09 19:25:50,459 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-09 19:25:50,463 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-09 19:25:50,464 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-09 19:25:50,468 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-09 19:25:50,469 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-09 19:25:50,475 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-09 19:25:50,488 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-09 19:25:50,488 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-09 19:25:52,556 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-09 19:25:52,558 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-09 19:25:52,578 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-09 19:25:52,581 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-09 19:25:52,587 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-09 19:25:52,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-09 19:25:54,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-09 19:25:54,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-09 19:25:54,721 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-09 19:25:54,722 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-09 19:25:54,743 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-09 19:25:54,749 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-09 19:25:54,762 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-09 19:25:54,766 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-09 19:25:54,771 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-09 19:25:54,771 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:144, output treesize:83 [2018-12-09 19:25:56,831 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-09 19:25:56,832 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-09 19:25:56,852 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-09 19:25:56,855 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-09 19:25:56,859 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-09 19:25:56,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-09 19:25:58,933 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-09 19:25:58,938 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-09 19:25:58,944 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-09 19:25:58,948 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-09 19:25:58,954 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-09 19:25:58,959 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-09 19:25:58,987 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-09 19:25:58,988 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-09 19:25:58,996 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-09 19:25:58,996 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-09 19:26:01,093 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-09 19:26:01,103 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-09 19:26:01,104 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-09 19:26:01,115 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-09 19:26:01,116 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-09 19:26:01,126 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-09 19:26:01,246 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-09 19:26:01,253 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-09 19:26:01,362 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-09 19:26:01,370 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-09 19:26:01,371 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-09 19:26:01,379 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-09 19:26:01,380 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-09 19:26:01,387 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-09 19:26:01,468 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-09 19:26:01,471 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-09 19:26:01,535 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-09 19:26:01,541 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-09 19:26:01,551 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-09 19:26:01,559 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-09 19:26:01,569 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-09 19:26:01,575 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-09 19:26:01,620 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-09 19:26:01,622 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-09 19:26:01,635 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-09 19:26:01,636 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 9 variables, input treesize:184, output treesize:103 [2018-12-09 19:26:01,800 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-09 19:26:01,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:26:01,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-12-09 19:26:01,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:26:01,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:26:01,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:26:01,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=515, Unknown=1, NotChecked=0, Total=600 [2018-12-09 19:26:01,816 INFO L87 Difference]: Start difference. First operand 891 states and 1336 transitions. Second operand 18 states. [2018-12-09 19:26:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:05,530 INFO L93 Difference]: Finished difference Result 2437 states and 3636 transitions. [2018-12-09 19:26:05,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:26:05,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2018-12-09 19:26:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:05,533 INFO L225 Difference]: With dead ends: 2437 [2018-12-09 19:26:05,533 INFO L226 Difference]: Without dead ends: 1571 [2018-12-09 19:26:05,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 339 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=222, Invalid=1037, Unknown=1, NotChecked=0, Total=1260 [2018-12-09 19:26:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2018-12-09 19:26:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 851. [2018-12-09 19:26:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-09 19:26:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1258 transitions. [2018-12-09 19:26:05,602 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1258 transitions. Word has length 179 [2018-12-09 19:26:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:05,603 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1258 transitions. [2018-12-09 19:26:05,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:26:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1258 transitions. [2018-12-09 19:26:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 19:26:05,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:05,605 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] [2018-12-09 19:26:05,605 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:05,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash 418863585, now seen corresponding path program 1 times [2018-12-09 19:26:05,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:05,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:05,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:05,655 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-09 19:26:05,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:05,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:26:05,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:05,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:26:05,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:26:05,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:26:05,656 INFO L87 Difference]: Start difference. First operand 851 states and 1258 transitions. Second operand 4 states. [2018-12-09 19:26:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:06,001 INFO L93 Difference]: Finished difference Result 1751 states and 2588 transitions. [2018-12-09 19:26:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:06,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-09 19:26:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:06,003 INFO L225 Difference]: With dead ends: 1751 [2018-12-09 19:26:06,003 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:26:06,004 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-09 19:26:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:26:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 851. [2018-12-09 19:26:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-09 19:26:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1256 transitions. [2018-12-09 19:26:06,067 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1256 transitions. Word has length 179 [2018-12-09 19:26:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1256 transitions. [2018-12-09 19:26:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:26:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1256 transitions. [2018-12-09 19:26:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-09 19:26:06,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:06,069 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, 1] [2018-12-09 19:26:06,069 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:06,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 525174052, now seen corresponding path program 1 times [2018-12-09 19:26:06,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:06,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:06,113 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-09 19:26:06,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:06,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:26:06,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:06,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:26:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:26:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:26:06,114 INFO L87 Difference]: Start difference. First operand 851 states and 1256 transitions. Second operand 4 states. [2018-12-09 19:26:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:06,462 INFO L93 Difference]: Finished difference Result 1751 states and 2584 transitions. [2018-12-09 19:26:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:06,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-09 19:26:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:06,463 INFO L225 Difference]: With dead ends: 1751 [2018-12-09 19:26:06,463 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:26:06,464 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-09 19:26:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:26:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 851. [2018-12-09 19:26:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-09 19:26:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1254 transitions. [2018-12-09 19:26:06,525 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1254 transitions. Word has length 180 [2018-12-09 19:26:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:06,525 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1254 transitions. [2018-12-09 19:26:06,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:26:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1254 transitions. [2018-12-09 19:26:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-09 19:26:06,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:06,526 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, 1] [2018-12-09 19:26:06,526 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:06,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash -512965562, now seen corresponding path program 1 times [2018-12-09 19:26:06,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:06,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:06,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:06,567 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-09 19:26:06,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:06,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:26:06,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:06,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:26:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:26:06,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:26:06,568 INFO L87 Difference]: Start difference. First operand 851 states and 1254 transitions. Second operand 4 states. [2018-12-09 19:26:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:06,863 INFO L93 Difference]: Finished difference Result 1751 states and 2580 transitions. [2018-12-09 19:26:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:06,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-12-09 19:26:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:06,865 INFO L225 Difference]: With dead ends: 1751 [2018-12-09 19:26:06,865 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:26:06,865 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-09 19:26:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:26:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 851. [2018-12-09 19:26:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-09 19:26:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1252 transitions. [2018-12-09 19:26:06,926 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1252 transitions. Word has length 181 [2018-12-09 19:26:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:06,926 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1252 transitions. [2018-12-09 19:26:06,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:26:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1252 transitions. [2018-12-09 19:26:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-09 19:26:06,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:06,927 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, 1] [2018-12-09 19:26:06,927 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:06,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1625647977, now seen corresponding path program 1 times [2018-12-09 19:26:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:06,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:06,993 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-09 19:26:06,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:06,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:26:06,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:06,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:26:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:26:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:26:06,993 INFO L87 Difference]: Start difference. First operand 851 states and 1252 transitions. Second operand 4 states. [2018-12-09 19:26:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:07,282 INFO L93 Difference]: Finished difference Result 1731 states and 2552 transitions. [2018-12-09 19:26:07,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:07,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-12-09 19:26:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:07,283 INFO L225 Difference]: With dead ends: 1731 [2018-12-09 19:26:07,283 INFO L226 Difference]: Without dead ends: 905 [2018-12-09 19:26:07,284 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-09 19:26:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-09 19:26:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 851. [2018-12-09 19:26:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-12-09 19:26:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1250 transitions. [2018-12-09 19:26:07,342 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1250 transitions. Word has length 182 [2018-12-09 19:26:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:07,342 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1250 transitions. [2018-12-09 19:26:07,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:26:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1250 transitions. [2018-12-09 19:26:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 19:26:07,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:07,343 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-09 19:26:07,343 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:07,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash 859716830, now seen corresponding path program 1 times [2018-12-09 19:26:07,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:07,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:07,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:07,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:07,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:07,421 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-09 19:26:07,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:07,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:26:07,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:07,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:26:07,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:26:07,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:26:07,421 INFO L87 Difference]: Start difference. First operand 851 states and 1250 transitions. Second operand 5 states. [2018-12-09 19:26:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:07,833 INFO L93 Difference]: Finished difference Result 1991 states and 2968 transitions. [2018-12-09 19:26:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:07,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-09 19:26:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:07,834 INFO L225 Difference]: With dead ends: 1991 [2018-12-09 19:26:07,835 INFO L226 Difference]: Without dead ends: 1165 [2018-12-09 19:26:07,835 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-09 19:26:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2018-12-09 19:26:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 929. [2018-12-09 19:26:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-12-09 19:26:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1392 transitions. [2018-12-09 19:26:07,897 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1392 transitions. Word has length 185 [2018-12-09 19:26:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:07,897 INFO L480 AbstractCegarLoop]: Abstraction has 929 states and 1392 transitions. [2018-12-09 19:26:07,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:26:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1392 transitions. [2018-12-09 19:26:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 19:26:07,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:07,898 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, 1] [2018-12-09 19:26:07,898 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:07,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:07,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1910773642, now seen corresponding path program 1 times [2018-12-09 19:26:07,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:07,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:07,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:07,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:07,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:07,959 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-09 19:26:07,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:07,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:26:07,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:07,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:26:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:26:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:26:07,959 INFO L87 Difference]: Start difference. First operand 929 states and 1392 transitions. Second operand 5 states. [2018-12-09 19:26:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:08,318 INFO L93 Difference]: Finished difference Result 2059 states and 3104 transitions. [2018-12-09 19:26:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:08,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2018-12-09 19:26:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:08,319 INFO L225 Difference]: With dead ends: 2059 [2018-12-09 19:26:08,319 INFO L226 Difference]: Without dead ends: 1155 [2018-12-09 19:26:08,320 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-09 19:26:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-12-09 19:26:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 983. [2018-12-09 19:26:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-12-09 19:26:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1502 transitions. [2018-12-09 19:26:08,382 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1502 transitions. Word has length 186 [2018-12-09 19:26:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:08,382 INFO L480 AbstractCegarLoop]: Abstraction has 983 states and 1502 transitions. [2018-12-09 19:26:08,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:26:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1502 transitions. [2018-12-09 19:26:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 19:26:08,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:08,383 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, 1] [2018-12-09 19:26:08,383 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:08,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1366502656, now seen corresponding path program 1 times [2018-12-09 19:26:08,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:08,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:08,788 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-09 19:26:08,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:08,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:26:08,789 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-12-09 19:26:08,789 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], [534], [641], [675], [677], [689], [692], [693], [694], [696] [2018-12-09 19:26:08,791 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:26:08,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:26:09,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:26:09,176 INFO L272 AbstractInterpreter]: Visited 87 different actions 365 times. Merged at 72 different actions 257 times. Never widened. Performed 2819 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2819 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 13 different actions. Largest state had 137 variables. [2018-12-09 19:26:09,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:09,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:26:09,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:26:09,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/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-09 19:26:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:09,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:26:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:09,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:26:09,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,327 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-09 19:26:09,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-09 19:26:09,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,359 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-09 19:26:09,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,382 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-09 19:26:09,383 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-09 19:26:09,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,386 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-09 19:26:09,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,390 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-09 19:26:09,390 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,397 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,413 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-09 19:26:09,414 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 19:26:09,453 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-09 19:26:09,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,463 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-09 19:26:09,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-09 19:26:09,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,508 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-09 19:26:09,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-09 19:26:09,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,542 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-09 19:26:09,542 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,561 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 19:26:09,581 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-09 19:26:09,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,588 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-09 19:26:09,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:26:09,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-09 19:26:09,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,618 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-09 19:26:09,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:26:09,638 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-09 19:26:09,640 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-09 19:26:09,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-09 19:26:09,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,662 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-09 19:26:09,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,676 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-09 19:26:09,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,711 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 19:26:09,716 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-09 19:26:09,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,723 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-09 19:26:09,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:26:09,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-09 19:26:09,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,749 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-09 19:26:09,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 19:26:09,774 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-09 19:26:09,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,783 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-09 19:26:09,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,810 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-09 19:26:09,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,819 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-09 19:26:09,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 19:26:09,843 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-09 19:26:09,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-09 19:26:09,845 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-09 19:26:09,847 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-09 19:26:09,859 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-09 19:26:09,861 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-09 19:26:09,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 19:26:09,875 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-09 19:26:09,877 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-09 19:26:09,891 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-09 19:26:09,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,902 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-09 19:26:09,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:09,915 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-09 19:26:09,916 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,945 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 19:26:09,949 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-09 19:26:09,951 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-09 19:26:09,951 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-09 19:26:09,953 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-09 19:26:09,972 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-09 19:26:09,974 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-09 19:26:09,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:09,986 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 19:26:10,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-09 19:26:10,005 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-09 19:26:10,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,034 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-09 19:26:10,038 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-09 19:26:10,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,065 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-09 19:26:10,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,071 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-09 19:26:10,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,097 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-09 19:26:10,108 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-09 19:26:10,153 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-09 19:26:10,157 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-09 19:26:10,204 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-09 19:26:10,219 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-09 19:26:10,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,278 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-09 19:26:10,282 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-09 19:26:10,282 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,293 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,332 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-09 19:26:10,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,362 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-09 19:26:10,362 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,396 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-09 19:26:10,398 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-09 19:26:10,398 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,421 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-09 19:26:10,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,438 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-09 19:26:10,438 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,462 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,475 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-09 19:26:10,487 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-09 19:26:10,507 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-09 19:26:10,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,510 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-09 19:26:10,511 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,515 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,528 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-09 19:26:10,560 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-09 19:26:10,561 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-09 19:26:10,562 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-09 19:26:10,567 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-09 19:26:10,582 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-09 19:26:10,584 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-09 19:26:10,585 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-09 19:26:10,593 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-09 19:26:10,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,603 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-09 19:26:10,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:10,607 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-09 19:26:10,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:10,618 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-09 19:26:10,619 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-09 19:26:10,827 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-09 19:26:10,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:26:10,909 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-09 19:26:10,916 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-09 19:26:10,947 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-09 19:26:10,954 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-09 19:26:10,976 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-09 19:26:10,987 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-09 19:26:11,002 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-09 19:26:11,005 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-09 19:26:11,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:11,022 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-09 19:26:11,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:26:11,026 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-09 19:26:11,027 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,033 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,040 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-09 19:26:11,044 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-09 19:26:11,044 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-09 19:26:11,047 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-09 19:26:11,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 159 [2018-12-09 19:26:11,057 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-09 19:26:11,057 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,069 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-09 19:26:11,081 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,081 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,082 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-09 19:26:11,082 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,099 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-09 19:26:11,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,102 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 107 treesize of output 98 [2018-12-09 19:26:11,102 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-09 19:26:11,115 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,125 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,125 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,126 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,126 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,126 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,126 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,127 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-09 19:26:11,127 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,137 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:26:11,140 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-09 19:26:11,142 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-09 19:26:11,143 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,148 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,149 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:26:11,149 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-09 19:26:11,149 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,152 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:26:11,159 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-09 19:26:11,164 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-09 19:26:11,173 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-09 19:26:11,173 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:98 [2018-12-09 19:26:11,198 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-09 19:26:11,200 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-09 19:26:11,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-09 19:26:11,203 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 41 treesize of output 37 [2018-12-09 19:26:11,204 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-09 19:26:11,205 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-09 19:26:11,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-09 19:26:11,235 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-09 19:26:11,237 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-09 19:26:11,244 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-09 19:26:11,245 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-09 19:26:11,246 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-09 19:26:11,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-09 19:26:11,262 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-09 19:26:11,264 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-09 19:26:11,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-09 19:26:11,267 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 41 treesize of output 37 [2018-12-09 19:26:11,268 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-09 19:26:11,269 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-09 19:26:11,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-09 19:26:11,303 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-09 19:26:11,305 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-09 19:26:11,312 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-09 19:26:11,314 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-09 19:26:11,315 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-09 19:26:11,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-09 19:26:11,346 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-09 19:26:11,347 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-09 19:26:11,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 19:26:11,364 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-09 19:26:11,365 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-09 19:26:11,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 19:26:11,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-09 19:26:11,383 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-09 19:26:11,391 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-09 19:26:11,392 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-09 19:26:11,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-09 19:26:11,410 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-09 19:26:11,411 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-09 19:26:11,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 19:26:11,429 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-09 19:26:11,430 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-09 19:26:11,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 19:26:11,445 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-09 19:26:11,447 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-09 19:26:11,456 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-09 19:26:11,457 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-09 19:26:11,464 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-09 19:26:11,465 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-09 19:26:11,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 19:26:11,467 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:20 [2018-12-09 19:26:11,565 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-09 19:26:11,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:26:11,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 23 [2018-12-09 19:26:11,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:26:11,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 19:26:11,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 19:26:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:26:11,581 INFO L87 Difference]: Start difference. First operand 983 states and 1502 transitions. Second operand 16 states. [2018-12-09 19:26:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:15,462 INFO L93 Difference]: Finished difference Result 3403 states and 5180 transitions. [2018-12-09 19:26:15,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:26:15,463 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 199 [2018-12-09 19:26:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:15,465 INFO L225 Difference]: With dead ends: 3403 [2018-12-09 19:26:15,466 INFO L226 Difference]: Without dead ends: 2445 [2018-12-09 19:26:15,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 375 SyntacticMatches, 23 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 19:26:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-12-09 19:26:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1445. [2018-12-09 19:26:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-09 19:26:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2292 transitions. [2018-12-09 19:26:15,567 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2292 transitions. Word has length 199 [2018-12-09 19:26:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:15,567 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 2292 transitions. [2018-12-09 19:26:15,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 19:26:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2292 transitions. [2018-12-09 19:26:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 19:26:15,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:15,569 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:15,569 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:15,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash -746591736, now seen corresponding path program 1 times [2018-12-09 19:26:15,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:15,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-09 19:26:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:26:15,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:15,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:26:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:26:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:26:15,631 INFO L87 Difference]: Start difference. First operand 1445 states and 2292 transitions. Second operand 4 states. [2018-12-09 19:26:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:15,937 INFO L93 Difference]: Finished difference Result 2919 states and 4632 transitions. [2018-12-09 19:26:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:15,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-12-09 19:26:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:15,939 INFO L225 Difference]: With dead ends: 2919 [2018-12-09 19:26:15,939 INFO L226 Difference]: Without dead ends: 1499 [2018-12-09 19:26:15,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-09 19:26:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-12-09 19:26:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1445. [2018-12-09 19:26:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-09 19:26:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2290 transitions. [2018-12-09 19:26:16,022 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2290 transitions. Word has length 206 [2018-12-09 19:26:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:16,022 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 2290 transitions. [2018-12-09 19:26:16,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:26:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2290 transitions. [2018-12-09 19:26:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 19:26:16,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:16,023 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:26:16,023 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:16,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:16,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1616344155, now seen corresponding path program 1 times [2018-12-09 19:26:16,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:16,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:16,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:16,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:26:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-09 19:26:16,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:26:16,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:26:16,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:26:16,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:26:16,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:26:16,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:26:16,080 INFO L87 Difference]: Start difference. First operand 1445 states and 2290 transitions. Second operand 4 states. [2018-12-09 19:26:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:16,396 INFO L93 Difference]: Finished difference Result 2915 states and 4624 transitions. [2018-12-09 19:26:16,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:26:16,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-09 19:26:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:16,398 INFO L225 Difference]: With dead ends: 2915 [2018-12-09 19:26:16,398 INFO L226 Difference]: Without dead ends: 1495 [2018-12-09 19:26:16,399 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-09 19:26:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-12-09 19:26:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1445. [2018-12-09 19:26:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-09 19:26:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2288 transitions. [2018-12-09 19:26:16,481 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2288 transitions. Word has length 207 [2018-12-09 19:26:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:16,481 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 2288 transitions. [2018-12-09 19:26:16,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:26:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2288 transitions. [2018-12-09 19:26:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-09 19:26:16,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:26:16,482 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, 1, 1, 1] [2018-12-09 19:26:16,482 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:26:16,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:26:16,483 INFO L82 PathProgramCache]: Analyzing trace with hash 778075477, now seen corresponding path program 1 times [2018-12-09 19:26:16,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:26:16,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:16,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:26:16,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:26:16,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:26:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:26:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:26:16,605 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:26:16,656 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-09 19:26:16,657 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-09 19:26:16,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:26:16 BoogieIcfgContainer [2018-12-09 19:26:16,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:26:16,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:26:16,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:26:16,726 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:26:16,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:17" (3/4) ... [2018-12-09 19:26:16,729 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 19:26:16,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:26:16,730 INFO L168 Benchmark]: Toolchain (without parser) took 60131.65 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 702.5 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -102.2 MB). Peak memory consumption was 600.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:16,731 INFO L168 Benchmark]: CDTParser took 0.12 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-09 19:26:16,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:16,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:16,731 INFO L168 Benchmark]: Boogie Preprocessor took 44.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:16,731 INFO L168 Benchmark]: RCFGBuilder took 555.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:16,731 INFO L168 Benchmark]: TraceAbstraction took 59144.29 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 551.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -21.7 MB). Peak memory consumption was 529.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:16,732 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 1.7 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:16,733 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.12 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 357.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 555.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59144.29 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 551.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -21.7 MB). Peak memory consumption was 529.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.67 ms. Allocated memory is still 1.7 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 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)# - 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)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1774]: 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)=24609, \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))={24596:0}, malloc(sizeof(SSL_CTX))={24612:0}, malloc(sizeof(SSL_SESSION))={24580:0}, malloc(sizeof(struct ssl3_state_st))={24602:0}, s={24596:0}, SSLv3_server_data={24590:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24579, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24579, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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 [L1602] EXPR s->session [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.new_cipher [L1602] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1603] COND FALSE !(! tmp___9) [L1609] ret = __VERIFIER_nondet_int() [L1610] COND FALSE !(blastFlag == 10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1613] COND FALSE !(blastFlag == 13) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1616] COND FALSE !(blastFlag == 16) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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 !(blastFlag == 19) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1627] COND FALSE !(ret <= 0) [L1632] s->state = 8672 [L1633] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1634] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24579, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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 [L1643] ret = __VERIFIER_nondet_int() [L1644] COND FALSE !(blastFlag == 11) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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] [L1647] COND FALSE !(blastFlag == 14) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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] [L1650] COND FALSE !(blastFlag == 17) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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] [L1653] COND FALSE !(blastFlag == 20) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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] [L1661] COND FALSE !(ret <= 0) [L1666] s->state = 8448 [L1667] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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] [L1667] COND TRUE s->hit [L1668] EXPR s->s3 [L1668] (s->s3)->tmp.next_state = 8640 [L1672] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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] [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24579, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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 [L1733] EXPR s->s3 [L1733] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24579, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24596:0}, s={24596: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] [L1733] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1762] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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={24596:0}, s={24596: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] [L1580] COND FALSE !(blastFlag == 18) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24596:0}, s={24596: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] [L1774] __VERIFIER_error() VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24596:0}, s={24596: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, 170 locations, 1 error locations. UNSAFE Result, 59.0s OverallTime, 119 OverallIterations, 8 TraceHistogramMax, 33.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 29394 SDtfs, 10320 SDslu, 49626 SDs, 0 SdLazy, 29856 SolverSat, 1481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1550 GetRequests, 946 SyntacticMatches, 188 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1445occurred in iteration=116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 118 MinimizatonAttempts, 9121 StatesRemovedByMinimization, 118 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 16195 NumberOfCodeBlocks, 16195 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 16243 ConstructedInterpolants, 319 QuantifiedInterpolants, 13306276 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1618 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 122 InterpolantComputations, 116 PerfectInterpolantSequences, 16959/17953 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-09 19:26:18,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:26:18,244 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:26:18,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:26:18,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:26:18,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:26:18,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:26:18,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:26:18,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:26:18,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:26:18,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:26:18,254 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:26:18,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:26:18,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:26:18,255 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:26:18,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:26:18,256 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:26:18,257 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:26:18,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:26:18,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:26:18,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:26:18,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:26:18,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:26:18,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:26:18,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:26:18,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:26:18,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:26:18,262 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:26:18,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:26:18,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:26:18,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:26:18,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:26:18,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:26:18,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:26:18,264 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:26:18,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:26:18,265 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 19:26:18,272 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:26:18,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:26:18,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:26:18,273 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:26:18,273 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:26:18,273 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:26:18,273 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:26:18,273 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:26:18,273 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:26:18,273 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:26:18,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:26:18,274 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:26:18,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:26:18,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:26:18,275 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 19:26:18,276 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:26:18,276 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 19:26:18,276 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 19:26:18,276 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_a2974603-3535-4c24-a14c-856f1ef3dc9d/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 -> 12b9509fef02d71cc2f0a70f9270a898a3e1b6a5 [2018-12-09 19:26:18,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:26:18,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:26:18,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:26:18,307 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:26:18,308 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:26:18,308 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-12-09 19:26:18,345 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/cfcbfe544/841aed5d02d749dfaa1dd08d4e9974f7/FLAG998bff6f2 [2018-12-09 19:26:18,826 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:26:18,827 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/sv-benchmarks/c/ssh/s3_srvr.blast.06_false-unreach-call.i.cil.c [2018-12-09 19:26:18,835 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/cfcbfe544/841aed5d02d749dfaa1dd08d4e9974f7/FLAG998bff6f2 [2018-12-09 19:26:18,843 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a2974603-3535-4c24-a14c-856f1ef3dc9d/bin-2019/utaipan/data/cfcbfe544/841aed5d02d749dfaa1dd08d4e9974f7 [2018-12-09 19:26:18,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:26:18,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:26:18,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:26:18,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:26:18,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:26:18,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:18" (1/1) ... [2018-12-09 19:26:18,850 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 09.12 07:26:18, skipping insertion in model container [2018-12-09 19:26:18,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:18" (1/1) ... [2018-12-09 19:26:18,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:26:18,894 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:26:19,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:26:19,121 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:26:19,216 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:26:19,216 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-09 19:26:19,219 INFO L168 Benchmark]: Toolchain (without parser) took 373.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:19,220 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-09 19:26:19,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:19,221 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 372.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 40.9 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...