./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17194510d9b99ec25b25421f731ec156f7460313 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17194510d9b99ec25b25421f731ec156f7460313 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:51:02,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:51:02,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:51:02,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:51:02,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:51:02,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:51:02,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:51:02,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:51:02,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:51:02,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:51:02,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:51:02,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:51:02,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:51:02,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:51:02,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:51:02,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:51:02,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:51:02,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:51:02,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:51:02,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:51:02,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:51:02,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:51:02,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:51:02,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:51:02,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:51:02,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:51:02,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:51:02,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:51:02,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:51:02,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:51:02,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:51:02,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:51:02,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:51:02,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:51:02,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:51:02,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:51:02,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:51:02,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:51:02,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:51:02,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:51:02,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:51:02,047 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:51:02,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:51:02,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:51:02,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:51:02,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:51:02,059 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:51:02,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:51:02,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:51:02,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:51:02,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:51:02,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:51:02,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:51:02,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:51:02,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:51:02,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:51:02,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:51:02,060 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:51:02,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:51:02,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:51:02,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:51:02,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:51:02,062 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:51:02,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17194510d9b99ec25b25421f731ec156f7460313 [2019-12-07 13:51:02,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:51:02,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:51:02,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:51:02,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:51:02,183 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:51:02,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-12-07 13:51:02,221 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/9421840e8/9aa939e984ab4a4da772c1363fb19956/FLAG35e8a7aea [2019-12-07 13:51:02,652 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:51:02,653 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-12-07 13:51:02,665 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/9421840e8/9aa939e984ab4a4da772c1363fb19956/FLAG35e8a7aea [2019-12-07 13:51:02,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/9421840e8/9aa939e984ab4a4da772c1363fb19956 [2019-12-07 13:51:02,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:51:02,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:51:02,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:51:02,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:51:02,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:51:02,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:51:02" (1/1) ... [2019-12-07 13:51:02,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@573e5c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:02, skipping insertion in model container [2019-12-07 13:51:02,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:51:02" (1/1) ... [2019-12-07 13:51:02,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:51:02,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:51:03,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:51:03,013 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:51:03,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:51:03,094 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:51:03,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03 WrapperNode [2019-12-07 13:51:03,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:51:03,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:51:03,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:51:03,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:51:03,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:51:03,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:51:03,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:51:03,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:51:03,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... [2019-12-07 13:51:03,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:51:03,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:51:03,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:51:03,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:51:03,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/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 [2019-12-07 13:51:03,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:51:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:51:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:51:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:51:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:51:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:51:03,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:51:03,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:51:03,367 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:51:03,872 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 13:51:03,872 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 13:51:03,873 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:51:03,873 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:51:03,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:03 BoogieIcfgContainer [2019-12-07 13:51:03,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:51:03,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:51:03,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:51:03,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:51:03,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:51:02" (1/3) ... [2019-12-07 13:51:03,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2621c75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:51:03, skipping insertion in model container [2019-12-07 13:51:03,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:03" (2/3) ... [2019-12-07 13:51:03,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2621c75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:51:03, skipping insertion in model container [2019-12-07 13:51:03,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:03" (3/3) ... [2019-12-07 13:51:03,879 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-12-07 13:51:03,885 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:51:03,890 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:51:03,898 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:51:03,914 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:51:03,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:51:03,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:51:03,914 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:51:03,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:51:03,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:51:03,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:51:03,915 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:51:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 13:51:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 13:51:03,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:03,934 INFO L410 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] [2019-12-07 13:51:03,935 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:03,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:03,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-12-07 13:51:03,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:03,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587867279] [2019-12-07 13:51:03,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:04,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587867279] [2019-12-07 13:51:04,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:04,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:04,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932693428] [2019-12-07 13:51:04,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:04,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:04,157 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 13:51:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:04,472 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-12-07 13:51:04,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:04,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 13:51:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:04,482 INFO L225 Difference]: With dead ends: 323 [2019-12-07 13:51:04,483 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 13:51:04,485 INFO L630 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 [2019-12-07 13:51:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 13:51:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 13:51:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-12-07 13:51:04,518 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-12-07 13:51:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:04,518 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-12-07 13:51:04,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-12-07 13:51:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:51:04,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:04,521 INFO L410 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] [2019-12-07 13:51:04,521 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-12-07 13:51:04,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:04,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400632300] [2019-12-07 13:51:04,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:04,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400632300] [2019-12-07 13:51:04,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:04,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:04,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457093738] [2019-12-07 13:51:04,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:04,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:04,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:04,601 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-12-07 13:51:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:04,835 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-12-07 13:51:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:04,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 13:51:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:04,837 INFO L225 Difference]: With dead ends: 290 [2019-12-07 13:51:04,837 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 13:51:04,838 INFO L630 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 [2019-12-07 13:51:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 13:51:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 13:51:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-12-07 13:51:04,847 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-12-07 13:51:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:04,847 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-12-07 13:51:04,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-12-07 13:51:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 13:51:04,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:04,849 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:04,850 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-12-07 13:51:04,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:04,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772570122] [2019-12-07 13:51:04,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:04,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772570122] [2019-12-07 13:51:04,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:04,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:04,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621183078] [2019-12-07 13:51:04,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:04,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:04,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:04,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:04,933 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-12-07 13:51:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:05,154 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-12-07 13:51:05,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:05,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 13:51:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:05,155 INFO L225 Difference]: With dead ends: 289 [2019-12-07 13:51:05,155 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 13:51:05,156 INFO L630 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 [2019-12-07 13:51:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 13:51:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-12-07 13:51:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-12-07 13:51:05,163 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-12-07 13:51:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:05,163 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-12-07 13:51:05,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-12-07 13:51:05,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 13:51:05,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:05,164 INFO L410 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] [2019-12-07 13:51:05,164 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-12-07 13:51:05,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:05,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363321064] [2019-12-07 13:51:05,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:05,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363321064] [2019-12-07 13:51:05,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:05,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:05,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152930008] [2019-12-07 13:51:05,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:05,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:05,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:05,209 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-12-07 13:51:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:05,416 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-12-07 13:51:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:05,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 13:51:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:05,418 INFO L225 Difference]: With dead ends: 287 [2019-12-07 13:51:05,418 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 13:51:05,419 INFO L630 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 [2019-12-07 13:51:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 13:51:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 13:51:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-12-07 13:51:05,425 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-12-07 13:51:05,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:05,425 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-12-07 13:51:05,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-12-07 13:51:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 13:51:05,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:05,426 INFO L410 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] [2019-12-07 13:51:05,426 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-12-07 13:51:05,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:05,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289384087] [2019-12-07 13:51:05,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:05,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289384087] [2019-12-07 13:51:05,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:05,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:05,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808630387] [2019-12-07 13:51:05,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:05,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:05,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:05,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:05,467 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-12-07 13:51:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:05,662 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-12-07 13:51:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:05,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 13:51:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:05,663 INFO L225 Difference]: With dead ends: 286 [2019-12-07 13:51:05,663 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 13:51:05,664 INFO L630 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 [2019-12-07 13:51:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 13:51:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 13:51:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-12-07 13:51:05,669 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-12-07 13:51:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:05,669 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-12-07 13:51:05,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-12-07 13:51:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 13:51:05,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:05,670 INFO L410 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] [2019-12-07 13:51:05,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-12-07 13:51:05,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:05,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120780378] [2019-12-07 13:51:05,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:05,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120780378] [2019-12-07 13:51:05,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:05,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:05,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789628782] [2019-12-07 13:51:05,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:05,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:05,708 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-12-07 13:51:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:05,909 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-12-07 13:51:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:05,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 13:51:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:05,910 INFO L225 Difference]: With dead ends: 286 [2019-12-07 13:51:05,911 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 13:51:05,911 INFO L630 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 [2019-12-07 13:51:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 13:51:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 13:51:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-12-07 13:51:05,915 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-12-07 13:51:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:05,915 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-12-07 13:51:05,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-12-07 13:51:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 13:51:05,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:05,916 INFO L410 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] [2019-12-07 13:51:05,916 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-12-07 13:51:05,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:05,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815061517] [2019-12-07 13:51:05,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:05,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815061517] [2019-12-07 13:51:05,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:05,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:05,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910019732] [2019-12-07 13:51:05,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:05,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:05,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:05,951 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-12-07 13:51:06,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:06,150 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-12-07 13:51:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:06,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 13:51:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:06,151 INFO L225 Difference]: With dead ends: 286 [2019-12-07 13:51:06,151 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 13:51:06,152 INFO L630 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 [2019-12-07 13:51:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 13:51:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 13:51:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-12-07 13:51:06,156 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-12-07 13:51:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:06,156 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-12-07 13:51:06,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-12-07 13:51:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:51:06,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:06,157 INFO L410 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] [2019-12-07 13:51:06,157 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:06,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:06,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-12-07 13:51:06,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:06,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914681060] [2019-12-07 13:51:06,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:06,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914681060] [2019-12-07 13:51:06,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:06,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:06,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865585440] [2019-12-07 13:51:06,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:06,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:06,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:06,198 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-12-07 13:51:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:06,425 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-12-07 13:51:06,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:06,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 13:51:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:06,427 INFO L225 Difference]: With dead ends: 286 [2019-12-07 13:51:06,427 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 13:51:06,427 INFO L630 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 [2019-12-07 13:51:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 13:51:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 13:51:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-12-07 13:51:06,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-12-07 13:51:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:06,430 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-12-07 13:51:06,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-12-07 13:51:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:51:06,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:06,431 INFO L410 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] [2019-12-07 13:51:06,431 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-12-07 13:51:06,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:06,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796414915] [2019-12-07 13:51:06,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:06,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796414915] [2019-12-07 13:51:06,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:06,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:06,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775114749] [2019-12-07 13:51:06,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:06,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:06,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:06,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:06,463 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-12-07 13:51:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:06,648 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-12-07 13:51:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:06,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 13:51:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:06,649 INFO L225 Difference]: With dead ends: 276 [2019-12-07 13:51:06,649 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 13:51:06,650 INFO L630 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 [2019-12-07 13:51:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 13:51:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-12-07 13:51:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 13:51:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-12-07 13:51:06,653 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-12-07 13:51:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:06,653 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-12-07 13:51:06,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-12-07 13:51:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:51:06,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:06,654 INFO L410 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] [2019-12-07 13:51:06,654 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:06,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-12-07 13:51:06,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:06,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442636889] [2019-12-07 13:51:06,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:06,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442636889] [2019-12-07 13:51:06,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:06,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:06,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136658541] [2019-12-07 13:51:06,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:06,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:06,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:06,696 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-12-07 13:51:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:06,906 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-12-07 13:51:06,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:06,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 13:51:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:06,907 INFO L225 Difference]: With dead ends: 316 [2019-12-07 13:51:06,907 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 13:51:06,908 INFO L630 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 [2019-12-07 13:51:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 13:51:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 13:51:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-12-07 13:51:06,911 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-12-07 13:51:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:06,912 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-12-07 13:51:06,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-12-07 13:51:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:51:06,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:06,913 INFO L410 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] [2019-12-07 13:51:06,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:06,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-12-07 13:51:06,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:06,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043066723] [2019-12-07 13:51:06,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:06,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043066723] [2019-12-07 13:51:06,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:06,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:06,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497437919] [2019-12-07 13:51:06,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:06,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:06,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:06,947 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-12-07 13:51:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:07,174 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-12-07 13:51:07,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:07,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:51:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:07,175 INFO L225 Difference]: With dead ends: 338 [2019-12-07 13:51:07,175 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 13:51:07,175 INFO L630 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 [2019-12-07 13:51:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 13:51:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 13:51:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-12-07 13:51:07,180 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-12-07 13:51:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:07,180 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-12-07 13:51:07,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-12-07 13:51:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:51:07,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:07,181 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:07,181 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-12-07 13:51:07,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:07,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688831260] [2019-12-07 13:51:07,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:07,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688831260] [2019-12-07 13:51:07,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:07,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:07,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294510314] [2019-12-07 13:51:07,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:07,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:07,218 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-12-07 13:51:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:07,435 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-12-07 13:51:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:07,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 13:51:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:07,437 INFO L225 Difference]: With dead ends: 337 [2019-12-07 13:51:07,437 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 13:51:07,438 INFO L630 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 [2019-12-07 13:51:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 13:51:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-12-07 13:51:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-12-07 13:51:07,442 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-12-07 13:51:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:07,443 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-12-07 13:51:07,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-12-07 13:51:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:51:07,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:07,444 INFO L410 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] [2019-12-07 13:51:07,444 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:07,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-12-07 13:51:07,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:07,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994188757] [2019-12-07 13:51:07,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:07,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994188757] [2019-12-07 13:51:07,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:07,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:07,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470251851] [2019-12-07 13:51:07,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:07,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:07,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:07,482 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-12-07 13:51:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:07,738 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-12-07 13:51:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:07,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 13:51:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:07,740 INFO L225 Difference]: With dead ends: 335 [2019-12-07 13:51:07,740 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 13:51:07,740 INFO L630 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 [2019-12-07 13:51:07,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 13:51:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-12-07 13:51:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-12-07 13:51:07,745 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-12-07 13:51:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:07,745 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-12-07 13:51:07,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-12-07 13:51:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:51:07,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:07,746 INFO L410 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] [2019-12-07 13:51:07,746 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-12-07 13:51:07,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:07,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521531552] [2019-12-07 13:51:07,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:07,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521531552] [2019-12-07 13:51:07,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:07,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:07,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089963363] [2019-12-07 13:51:07,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:07,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:07,776 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-12-07 13:51:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:07,999 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-12-07 13:51:07,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:07,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 13:51:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:08,000 INFO L225 Difference]: With dead ends: 334 [2019-12-07 13:51:08,000 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 13:51:08,001 INFO L630 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 [2019-12-07 13:51:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 13:51:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 13:51:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-12-07 13:51:08,005 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-12-07 13:51:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:08,005 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-12-07 13:51:08,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-12-07 13:51:08,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:51:08,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:08,005 INFO L410 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] [2019-12-07 13:51:08,005 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-12-07 13:51:08,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:08,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561580915] [2019-12-07 13:51:08,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:08,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561580915] [2019-12-07 13:51:08,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:08,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:08,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093945543] [2019-12-07 13:51:08,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:08,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:08,041 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-12-07 13:51:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:08,282 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-12-07 13:51:08,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:08,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 13:51:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:08,284 INFO L225 Difference]: With dead ends: 334 [2019-12-07 13:51:08,284 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 13:51:08,284 INFO L630 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 [2019-12-07 13:51:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 13:51:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 13:51:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-12-07 13:51:08,288 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-12-07 13:51:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:08,288 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-12-07 13:51:08,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-12-07 13:51:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:51:08,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:08,288 INFO L410 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] [2019-12-07 13:51:08,288 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-12-07 13:51:08,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:08,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820558109] [2019-12-07 13:51:08,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:08,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820558109] [2019-12-07 13:51:08,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:08,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:08,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249060527] [2019-12-07 13:51:08,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:08,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:08,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:08,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:08,314 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-12-07 13:51:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:08,518 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-12-07 13:51:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:08,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 13:51:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:08,520 INFO L225 Difference]: With dead ends: 334 [2019-12-07 13:51:08,520 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 13:51:08,520 INFO L630 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 [2019-12-07 13:51:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 13:51:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 13:51:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-12-07 13:51:08,524 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-12-07 13:51:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:08,524 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-12-07 13:51:08,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-12-07 13:51:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 13:51:08,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:08,525 INFO L410 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] [2019-12-07 13:51:08,525 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-12-07 13:51:08,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:08,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861784573] [2019-12-07 13:51:08,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:08,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861784573] [2019-12-07 13:51:08,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:08,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:08,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110069830] [2019-12-07 13:51:08,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:08,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:08,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:08,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:08,558 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-12-07 13:51:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:08,771 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-12-07 13:51:08,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:08,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 13:51:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:08,772 INFO L225 Difference]: With dead ends: 334 [2019-12-07 13:51:08,772 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 13:51:08,773 INFO L630 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 [2019-12-07 13:51:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 13:51:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 13:51:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-12-07 13:51:08,777 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-12-07 13:51:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:08,777 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-12-07 13:51:08,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-12-07 13:51:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 13:51:08,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:08,778 INFO L410 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] [2019-12-07 13:51:08,778 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:08,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-12-07 13:51:08,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:08,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761670439] [2019-12-07 13:51:08,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:08,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761670439] [2019-12-07 13:51:08,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:08,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:08,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574061612] [2019-12-07 13:51:08,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:08,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:08,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:08,814 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-12-07 13:51:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:09,000 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-12-07 13:51:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:09,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 13:51:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:09,001 INFO L225 Difference]: With dead ends: 324 [2019-12-07 13:51:09,001 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 13:51:09,001 INFO L630 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 [2019-12-07 13:51:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 13:51:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-12-07 13:51:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 13:51:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-12-07 13:51:09,004 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-12-07 13:51:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:09,004 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-12-07 13:51:09,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-12-07 13:51:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:51:09,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:09,005 INFO L410 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] [2019-12-07 13:51:09,005 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-12-07 13:51:09,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:09,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538260457] [2019-12-07 13:51:09,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:09,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538260457] [2019-12-07 13:51:09,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:09,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:09,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043147889] [2019-12-07 13:51:09,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:09,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:09,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:09,043 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-12-07 13:51:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:09,346 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-12-07 13:51:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:09,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 13:51:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:09,347 INFO L225 Difference]: With dead ends: 424 [2019-12-07 13:51:09,347 INFO L226 Difference]: Without dead ends: 275 [2019-12-07 13:51:09,348 INFO L630 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 [2019-12-07 13:51:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-07 13:51:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-12-07 13:51:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 13:51:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-12-07 13:51:09,352 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-12-07 13:51:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:09,352 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-12-07 13:51:09,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-12-07 13:51:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:51:09,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:09,353 INFO L410 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] [2019-12-07 13:51:09,353 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:09,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-12-07 13:51:09,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:09,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770496166] [2019-12-07 13:51:09,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:09,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770496166] [2019-12-07 13:51:09,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:09,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:09,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518984838] [2019-12-07 13:51:09,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:09,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:09,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:09,394 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-12-07 13:51:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:09,631 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-12-07 13:51:09,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:09,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 13:51:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:09,632 INFO L225 Difference]: With dead ends: 427 [2019-12-07 13:51:09,633 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 13:51:09,633 INFO L630 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 [2019-12-07 13:51:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 13:51:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-12-07 13:51:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 13:51:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-12-07 13:51:09,636 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-12-07 13:51:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:09,636 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-12-07 13:51:09,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-12-07 13:51:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 13:51:09,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:09,637 INFO L410 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] [2019-12-07 13:51:09,637 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:09,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-12-07 13:51:09,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:09,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432325277] [2019-12-07 13:51:09,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:09,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432325277] [2019-12-07 13:51:09,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:09,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:09,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034873069] [2019-12-07 13:51:09,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:09,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:09,683 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-12-07 13:51:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:09,999 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-12-07 13:51:09,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:09,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 13:51:09,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:10,000 INFO L225 Difference]: With dead ends: 494 [2019-12-07 13:51:10,000 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 13:51:10,001 INFO L630 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 [2019-12-07 13:51:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 13:51:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-12-07 13:51:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 13:51:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-12-07 13:51:10,004 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-12-07 13:51:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:10,005 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-12-07 13:51:10,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-12-07 13:51:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 13:51:10,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:10,005 INFO L410 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] [2019-12-07 13:51:10,005 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 979572393, now seen corresponding path program 1 times [2019-12-07 13:51:10,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:10,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909222717] [2019-12-07 13:51:10,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:10,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909222717] [2019-12-07 13:51:10,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:10,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:10,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273136197] [2019-12-07 13:51:10,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:10,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:10,045 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-12-07 13:51:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:10,363 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-12-07 13:51:10,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:10,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 13:51:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:10,365 INFO L225 Difference]: With dead ends: 495 [2019-12-07 13:51:10,365 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 13:51:10,365 INFO L630 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 [2019-12-07 13:51:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 13:51:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-12-07 13:51:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 13:51:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-12-07 13:51:10,369 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-12-07 13:51:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:10,369 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-12-07 13:51:10,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-12-07 13:51:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 13:51:10,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:10,370 INFO L410 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] [2019-12-07 13:51:10,370 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash 294608539, now seen corresponding path program 1 times [2019-12-07 13:51:10,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:10,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321114374] [2019-12-07 13:51:10,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:10,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321114374] [2019-12-07 13:51:10,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:10,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:10,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483374003] [2019-12-07 13:51:10,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:10,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:10,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:10,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:10,420 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-12-07 13:51:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:10,718 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-12-07 13:51:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:10,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 13:51:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:10,719 INFO L225 Difference]: With dead ends: 499 [2019-12-07 13:51:10,719 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 13:51:10,720 INFO L630 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 [2019-12-07 13:51:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 13:51:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-12-07 13:51:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 13:51:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-12-07 13:51:10,723 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-12-07 13:51:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:10,724 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-12-07 13:51:10,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-12-07 13:51:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 13:51:10,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:10,724 INFO L410 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] [2019-12-07 13:51:10,724 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:10,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:10,725 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-12-07 13:51:10,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:10,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660106738] [2019-12-07 13:51:10,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:10,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660106738] [2019-12-07 13:51:10,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:10,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:10,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756013493] [2019-12-07 13:51:10,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:10,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:10,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:10,760 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-12-07 13:51:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:11,063 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-12-07 13:51:11,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:11,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 13:51:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:11,064 INFO L225 Difference]: With dead ends: 500 [2019-12-07 13:51:11,064 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 13:51:11,065 INFO L630 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 [2019-12-07 13:51:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 13:51:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-12-07 13:51:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 13:51:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-12-07 13:51:11,069 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-12-07 13:51:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:11,069 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-12-07 13:51:11,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-12-07 13:51:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 13:51:11,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:11,070 INFO L410 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] [2019-12-07 13:51:11,070 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-12-07 13:51:11,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:11,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667748610] [2019-12-07 13:51:11,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:11,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667748610] [2019-12-07 13:51:11,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:11,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:11,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770890387] [2019-12-07 13:51:11,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:11,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:11,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:11,109 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-12-07 13:51:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:11,358 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-12-07 13:51:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:11,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 13:51:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:11,360 INFO L225 Difference]: With dead ends: 475 [2019-12-07 13:51:11,360 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 13:51:11,360 INFO L630 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 [2019-12-07 13:51:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 13:51:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-12-07 13:51:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 13:51:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-12-07 13:51:11,364 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-12-07 13:51:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:11,365 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-12-07 13:51:11,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-12-07 13:51:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:51:11,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:11,366 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 13:51:11,366 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:11,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:11,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-12-07 13:51:11,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:11,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868432005] [2019-12-07 13:51:11,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:11,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868432005] [2019-12-07 13:51:11,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:11,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:11,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029506428] [2019-12-07 13:51:11,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:11,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:11,408 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-12-07 13:51:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:11,714 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-12-07 13:51:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:11,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 13:51:11,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:11,716 INFO L225 Difference]: With dead ends: 499 [2019-12-07 13:51:11,716 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 13:51:11,716 INFO L630 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 [2019-12-07 13:51:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 13:51:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-12-07 13:51:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 13:51:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-12-07 13:51:11,720 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-12-07 13:51:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:11,720 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-12-07 13:51:11,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-12-07 13:51:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:51:11,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:11,721 INFO L410 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] [2019-12-07 13:51:11,721 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-12-07 13:51:11,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:11,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306411789] [2019-12-07 13:51:11,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:11,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306411789] [2019-12-07 13:51:11,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:11,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:11,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460044997] [2019-12-07 13:51:11,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:11,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:11,758 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-12-07 13:51:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:12,223 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-12-07 13:51:12,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:12,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 13:51:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:12,226 INFO L225 Difference]: With dead ends: 497 [2019-12-07 13:51:12,226 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 13:51:12,227 INFO L630 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 [2019-12-07 13:51:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 13:51:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-12-07 13:51:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 13:51:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-12-07 13:51:12,237 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-12-07 13:51:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:12,237 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-12-07 13:51:12,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-12-07 13:51:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:51:12,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:12,240 INFO L410 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] [2019-12-07 13:51:12,240 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-12-07 13:51:12,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:12,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144588370] [2019-12-07 13:51:12,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:12,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144588370] [2019-12-07 13:51:12,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:12,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:12,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652432804] [2019-12-07 13:51:12,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:12,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:12,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:12,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:12,282 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-12-07 13:51:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:12,538 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-12-07 13:51:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:12,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 13:51:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:12,539 INFO L225 Difference]: With dead ends: 496 [2019-12-07 13:51:12,539 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 13:51:12,540 INFO L630 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 [2019-12-07 13:51:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 13:51:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-12-07 13:51:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 13:51:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-12-07 13:51:12,543 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-12-07 13:51:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:12,543 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-12-07 13:51:12,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-12-07 13:51:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:51:12,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:12,544 INFO L410 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] [2019-12-07 13:51:12,544 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-12-07 13:51:12,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:12,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169664255] [2019-12-07 13:51:12,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 13:51:12,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169664255] [2019-12-07 13:51:12,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:12,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:51:12,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022289123] [2019-12-07 13:51:12,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:51:12,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:51:12,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:51:12,583 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-12-07 13:51:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:12,894 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-12-07 13:51:12,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:51:12,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-12-07 13:51:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:12,896 INFO L225 Difference]: With dead ends: 470 [2019-12-07 13:51:12,896 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 13:51:12,896 INFO L630 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 [2019-12-07 13:51:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 13:51:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-12-07 13:51:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-12-07 13:51:12,900 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-12-07 13:51:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:12,900 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-12-07 13:51:12,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:51:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-12-07 13:51:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:51:12,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:12,901 INFO L410 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] [2019-12-07 13:51:12,901 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-12-07 13:51:12,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:12,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472114544] [2019-12-07 13:51:12,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:12,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472114544] [2019-12-07 13:51:12,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:12,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:12,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078264771] [2019-12-07 13:51:12,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:12,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:12,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:12,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:12,933 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-12-07 13:51:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:13,148 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-12-07 13:51:13,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:13,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 13:51:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:13,149 INFO L225 Difference]: With dead ends: 512 [2019-12-07 13:51:13,149 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 13:51:13,150 INFO L630 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 [2019-12-07 13:51:13,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 13:51:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-12-07 13:51:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-12-07 13:51:13,153 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-12-07 13:51:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:13,154 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-12-07 13:51:13,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-12-07 13:51:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 13:51:13,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:13,154 INFO L410 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] [2019-12-07 13:51:13,154 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-12-07 13:51:13,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:13,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767659528] [2019-12-07 13:51:13,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:13,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767659528] [2019-12-07 13:51:13,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:13,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:13,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960723992] [2019-12-07 13:51:13,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:13,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:13,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:13,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:13,185 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-12-07 13:51:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:13,406 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-12-07 13:51:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:13,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 13:51:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:13,408 INFO L225 Difference]: With dead ends: 511 [2019-12-07 13:51:13,408 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:51:13,409 INFO L630 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 [2019-12-07 13:51:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:51:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 13:51:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-12-07 13:51:13,413 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-12-07 13:51:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:13,413 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-12-07 13:51:13,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-12-07 13:51:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 13:51:13,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:13,414 INFO L410 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] [2019-12-07 13:51:13,414 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-12-07 13:51:13,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:13,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585000704] [2019-12-07 13:51:13,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:13,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585000704] [2019-12-07 13:51:13,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:13,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:13,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678170437] [2019-12-07 13:51:13,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:13,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:13,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:13,457 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-12-07 13:51:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:13,714 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-12-07 13:51:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:13,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 13:51:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:13,716 INFO L225 Difference]: With dead ends: 536 [2019-12-07 13:51:13,716 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 13:51:13,717 INFO L630 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 [2019-12-07 13:51:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 13:51:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-12-07 13:51:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-12-07 13:51:13,721 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-12-07 13:51:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:13,721 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-12-07 13:51:13,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-12-07 13:51:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 13:51:13,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:13,722 INFO L410 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] [2019-12-07 13:51:13,722 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-12-07 13:51:13,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:13,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906479541] [2019-12-07 13:51:13,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:13,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906479541] [2019-12-07 13:51:13,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:13,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:13,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886620967] [2019-12-07 13:51:13,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:13,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:13,758 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-12-07 13:51:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:13,983 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-12-07 13:51:13,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:13,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 13:51:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:13,985 INFO L225 Difference]: With dead ends: 511 [2019-12-07 13:51:13,985 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:51:13,985 INFO L630 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 [2019-12-07 13:51:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:51:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 13:51:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-12-07 13:51:13,990 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-12-07 13:51:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:13,990 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-12-07 13:51:13,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-12-07 13:51:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 13:51:13,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:13,991 INFO L410 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] [2019-12-07 13:51:13,991 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:13,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-12-07 13:51:13,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:13,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626427124] [2019-12-07 13:51:13,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:14,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626427124] [2019-12-07 13:51:14,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:14,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:14,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740858674] [2019-12-07 13:51:14,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:14,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:14,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:14,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:14,030 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-12-07 13:51:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:14,299 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-12-07 13:51:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:14,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 13:51:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:14,301 INFO L225 Difference]: With dead ends: 536 [2019-12-07 13:51:14,301 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 13:51:14,301 INFO L630 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 [2019-12-07 13:51:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 13:51:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-12-07 13:51:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-12-07 13:51:14,306 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-12-07 13:51:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:14,306 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-12-07 13:51:14,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-12-07 13:51:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 13:51:14,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:14,306 INFO L410 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] [2019-12-07 13:51:14,307 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-12-07 13:51:14,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:14,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917904791] [2019-12-07 13:51:14,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:14,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917904791] [2019-12-07 13:51:14,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:14,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:14,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178939646] [2019-12-07 13:51:14,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:14,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:14,336 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-12-07 13:51:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:14,546 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-12-07 13:51:14,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:14,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 13:51:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:14,548 INFO L225 Difference]: With dead ends: 511 [2019-12-07 13:51:14,548 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:51:14,548 INFO L630 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 [2019-12-07 13:51:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:51:14,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 13:51:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-12-07 13:51:14,552 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-12-07 13:51:14,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:14,552 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-12-07 13:51:14,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-12-07 13:51:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 13:51:14,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:14,552 INFO L410 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] [2019-12-07 13:51:14,553 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-12-07 13:51:14,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:14,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771385567] [2019-12-07 13:51:14,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:14,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771385567] [2019-12-07 13:51:14,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:14,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:14,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665229552] [2019-12-07 13:51:14,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:14,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:14,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:14,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:14,584 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-12-07 13:51:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:14,861 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-12-07 13:51:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:14,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 13:51:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:14,863 INFO L225 Difference]: With dead ends: 536 [2019-12-07 13:51:14,863 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 13:51:14,863 INFO L630 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 [2019-12-07 13:51:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 13:51:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-12-07 13:51:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-12-07 13:51:14,868 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-12-07 13:51:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:14,868 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-12-07 13:51:14,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-12-07 13:51:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 13:51:14,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:14,869 INFO L410 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] [2019-12-07 13:51:14,869 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:14,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-12-07 13:51:14,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:14,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151635823] [2019-12-07 13:51:14,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:14,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151635823] [2019-12-07 13:51:14,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:14,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:14,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244221245] [2019-12-07 13:51:14,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:14,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:14,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:14,906 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-12-07 13:51:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:15,118 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-12-07 13:51:15,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:15,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 13:51:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:15,119 INFO L225 Difference]: With dead ends: 511 [2019-12-07 13:51:15,119 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 13:51:15,120 INFO L630 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 [2019-12-07 13:51:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 13:51:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 13:51:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-12-07 13:51:15,123 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-12-07 13:51:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:15,124 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-12-07 13:51:15,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-12-07 13:51:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 13:51:15,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:15,124 INFO L410 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] [2019-12-07 13:51:15,124 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-12-07 13:51:15,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:15,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661563717] [2019-12-07 13:51:15,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:15,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661563717] [2019-12-07 13:51:15,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:15,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:15,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310988041] [2019-12-07 13:51:15,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:15,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:15,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:15,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:15,155 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-12-07 13:51:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:15,407 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-12-07 13:51:15,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:15,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 13:51:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:15,409 INFO L225 Difference]: With dead ends: 526 [2019-12-07 13:51:15,409 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 13:51:15,409 INFO L630 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 [2019-12-07 13:51:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 13:51:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-12-07 13:51:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-12-07 13:51:15,416 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-12-07 13:51:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:15,416 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-12-07 13:51:15,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-12-07 13:51:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 13:51:15,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:15,417 INFO L410 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] [2019-12-07 13:51:15,418 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:15,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-12-07 13:51:15,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:15,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258790080] [2019-12-07 13:51:15,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:15,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258790080] [2019-12-07 13:51:15,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:15,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:15,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949894467] [2019-12-07 13:51:15,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:15,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:15,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:15,460 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-12-07 13:51:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:15,669 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-12-07 13:51:15,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:15,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 13:51:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:15,670 INFO L225 Difference]: With dead ends: 501 [2019-12-07 13:51:15,670 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 13:51:15,671 INFO L630 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 [2019-12-07 13:51:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 13:51:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-12-07 13:51:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-12-07 13:51:15,674 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-12-07 13:51:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:15,675 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-12-07 13:51:15,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-12-07 13:51:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:51:15,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:15,675 INFO L410 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] [2019-12-07 13:51:15,675 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:15,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-12-07 13:51:15,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:15,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812177092] [2019-12-07 13:51:15,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:15,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812177092] [2019-12-07 13:51:15,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:15,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:15,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361341129] [2019-12-07 13:51:15,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:15,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:15,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:15,707 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-12-07 13:51:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:15,959 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-12-07 13:51:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:15,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 13:51:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:15,960 INFO L225 Difference]: With dead ends: 526 [2019-12-07 13:51:15,960 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 13:51:15,961 INFO L630 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 [2019-12-07 13:51:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 13:51:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-12-07 13:51:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 13:51:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-12-07 13:51:15,965 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-12-07 13:51:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:15,965 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-12-07 13:51:15,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-12-07 13:51:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 13:51:15,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:15,966 INFO L410 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] [2019-12-07 13:51:15,966 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-12-07 13:51:15,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:15,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759705212] [2019-12-07 13:51:15,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 13:51:16,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759705212] [2019-12-07 13:51:16,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:16,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:51:16,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591693740] [2019-12-07 13:51:16,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:51:16,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:16,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:51:16,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:51:16,003 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-12-07 13:51:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:16,046 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-12-07 13:51:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:51:16,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 13:51:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:16,049 INFO L225 Difference]: With dead ends: 722 [2019-12-07 13:51:16,049 INFO L226 Difference]: Without dead ends: 487 [2019-12-07 13:51:16,050 INFO L630 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 [2019-12-07 13:51:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-07 13:51:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-12-07 13:51:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 13:51:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-12-07 13:51:16,060 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-12-07 13:51:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:16,061 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-12-07 13:51:16,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:51:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-12-07 13:51:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:51:16,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:16,062 INFO L410 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] [2019-12-07 13:51:16,062 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-12-07 13:51:16,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:16,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105030495] [2019-12-07 13:51:16,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:51:16,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105030495] [2019-12-07 13:51:16,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:16,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:51:16,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959067097] [2019-12-07 13:51:16,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:51:16,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:51:16,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:51:16,102 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-12-07 13:51:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:16,144 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-12-07 13:51:16,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:51:16,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 13:51:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:16,148 INFO L225 Difference]: With dead ends: 1190 [2019-12-07 13:51:16,148 INFO L226 Difference]: Without dead ends: 722 [2019-12-07 13:51:16,149 INFO L630 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 [2019-12-07 13:51:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-07 13:51:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-12-07 13:51:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 13:51:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-12-07 13:51:16,164 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-12-07 13:51:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:16,165 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-12-07 13:51:16,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:51:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-12-07 13:51:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 13:51:16,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:16,166 INFO L410 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] [2019-12-07 13:51:16,166 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1028721671, now seen corresponding path program 1 times [2019-12-07 13:51:16,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:16,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086388886] [2019-12-07 13:51:16,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:51:16,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086388886] [2019-12-07 13:51:16,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:16,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:51:16,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597758901] [2019-12-07 13:51:16,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:51:16,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:16,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:51:16,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:51:16,206 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-12-07 13:51:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:16,275 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-12-07 13:51:16,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:51:16,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 13:51:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:16,279 INFO L225 Difference]: With dead ends: 1656 [2019-12-07 13:51:16,279 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 13:51:16,280 INFO L630 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 [2019-12-07 13:51:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 13:51:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-12-07 13:51:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-07 13:51:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-12-07 13:51:16,293 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-12-07 13:51:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:16,293 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-12-07 13:51:16,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:51:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-12-07 13:51:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 13:51:16,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:16,295 INFO L410 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] [2019-12-07 13:51:16,295 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1513823389, now seen corresponding path program 1 times [2019-12-07 13:51:16,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:16,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219546689] [2019-12-07 13:51:16,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:51:16,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219546689] [2019-12-07 13:51:16,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:16,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:51:16,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374433956] [2019-12-07 13:51:16,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:51:16,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:51:16,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:51:16,327 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-12-07 13:51:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:16,368 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-12-07 13:51:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:51:16,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 13:51:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:16,372 INFO L225 Difference]: With dead ends: 2120 [2019-12-07 13:51:16,373 INFO L226 Difference]: Without dead ends: 1186 [2019-12-07 13:51:16,373 INFO L630 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 [2019-12-07 13:51:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-07 13:51:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-07 13:51:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-07 13:51:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-12-07 13:51:16,390 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-12-07 13:51:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:16,391 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-12-07 13:51:16,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:51:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-12-07 13:51:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 13:51:16,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:16,392 INFO L410 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] [2019-12-07 13:51:16,392 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:16,392 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-12-07 13:51:16,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:16,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984391012] [2019-12-07 13:51:16,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 13:51:16,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984391012] [2019-12-07 13:51:16,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:16,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:51:16,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278346267] [2019-12-07 13:51:16,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:51:16,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:51:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:51:16,427 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-12-07 13:51:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:16,467 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-12-07 13:51:16,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:51:16,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-12-07 13:51:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:16,472 INFO L225 Difference]: With dead ends: 1423 [2019-12-07 13:51:16,472 INFO L226 Difference]: Without dead ends: 1421 [2019-12-07 13:51:16,473 INFO L630 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 [2019-12-07 13:51:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-12-07 13:51:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-12-07 13:51:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-07 13:51:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-12-07 13:51:16,493 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-12-07 13:51:16,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:16,493 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-12-07 13:51:16,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:51:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-12-07 13:51:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 13:51:16,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:16,495 INFO L410 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] [2019-12-07 13:51:16,495 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1090500354, now seen corresponding path program 1 times [2019-12-07 13:51:16,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:16,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262446517] [2019-12-07 13:51:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 13:51:16,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262446517] [2019-12-07 13:51:16,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:16,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:16,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482493376] [2019-12-07 13:51:16,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:16,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:16,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:16,544 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 4 states. [2019-12-07 13:51:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:16,836 INFO L93 Difference]: Finished difference Result 3197 states and 4729 transitions. [2019-12-07 13:51:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:16,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 13:51:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:16,843 INFO L225 Difference]: With dead ends: 3197 [2019-12-07 13:51:16,843 INFO L226 Difference]: Without dead ends: 1797 [2019-12-07 13:51:16,844 INFO L630 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 [2019-12-07 13:51:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-12-07 13:51:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1587. [2019-12-07 13:51:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-12-07 13:51:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2380 transitions. [2019-12-07 13:51:16,868 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2380 transitions. Word has length 163 [2019-12-07 13:51:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:16,868 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 2380 transitions. [2019-12-07 13:51:16,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2380 transitions. [2019-12-07 13:51:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 13:51:16,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:16,870 INFO L410 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] [2019-12-07 13:51:16,870 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-12-07 13:51:16,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:16,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675866071] [2019-12-07 13:51:16,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:51:17,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675866071] [2019-12-07 13:51:17,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935692578] [2019-12-07 13:51:17,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:17,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 13:51:17,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:17,296 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 13:51:17,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,329 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 13:51:17,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:17,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:17,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:17,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:17,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:17,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:17,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 13:51:17,362 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,389 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:17,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,456 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:51:17,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 46 [2019-12-07 13:51:17,457 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,468 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 13:51:17,502 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:51:17,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 13:51:17,503 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:51:17,534 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:51:17,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 13:51:17,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,540 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:51:17,543 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-12-07 13:51:17,545 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:17,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,592 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 13:51:17,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 13:51:17,593 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,600 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,600 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 13:51:17,624 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:51:17,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 13:51:17,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:51:17,651 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 13:51:17,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 13:51:17,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:17,658 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 13:51:17,664 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 13:51:17,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:17,668 INFO L377 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 49 treesize of output 37 [2019-12-07 13:51:17,669 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:17,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:17,791 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-07 13:51:17,792 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-12-07 13:51:17,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-12-07 13:51:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:17,829 INFO L534 ElimStorePlain]: Start of recursive call 3: 21 dim-0 vars, End of recursive call: 21 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:17,981 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 62 [2019-12-07 13:51:17,981 INFO L614 ElimStorePlain]: treesize reduction 2428, result has 8.4 percent of original size [2019-12-07 13:51:17,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:17,983 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:251 [2019-12-07 13:51:18,041 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-12-07 13:51:18,043 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:18,057 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:18,176 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-12-07 13:51:18,176 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-12-07 13:51:18,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-12-07 13:51:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,178 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:18,206 INFO L614 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-12-07 13:51:18,206 INFO L534 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. [2019-12-07 13:51:18,206 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-12-07 13:51:18,232 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 13:51:18,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 13:51:18,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:18,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:18,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,392 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 13:51:18,393 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-12-07 13:51:18,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-12-07 13:51:18,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:18,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:18,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,398 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:18,501 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 40 [2019-12-07 13:51:18,501 INFO L614 ElimStorePlain]: treesize reduction 4709, result has 1.9 percent of original size [2019-12-07 13:51:18,502 INFO L534 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. [2019-12-07 13:51:18,502 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-12-07 13:51:18,525 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 13:51:18,528 INFO L377 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 25 [2019-12-07 13:51:18,528 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:18,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:18,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 28 [2019-12-07 13:51:18,544 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:18,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:18,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:18,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:18,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-12-07 13:51:18,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:18,638 INFO L534 ElimStorePlain]: Start of recursive call 4: 131 dim-0 vars, End of recursive call: 131 dim-0 vars, and 17 xjuncts. [2019-12-07 13:51:21,375 WARN L192 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 1060 [2019-12-07 13:51:21,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:21,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 12 terms [2019-12-07 13:51:21,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-07 13:51:21,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 13:51:21,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-07 13:51:21,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:51:21,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:21,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 262 dim-0 vars, and 1 xjuncts. [2019-12-07 13:51:21,433 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1845 [2019-12-07 13:51:22,350 WARN L192 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 1323 DAG size of output: 22 [2019-12-07 13:51:22,360 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:51:22,361 INFO L377 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 13:51:22,361 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:22,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:22,366 INFO L534 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. [2019-12-07 13:51:22,367 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 13:51:22,403 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 13:51:22,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 13:51:22,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:22,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:22,407 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:22,407 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 13:51:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:51:22,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:51:22,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-12-07 13:51:22,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778735556] [2019-12-07 13:51:22,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:51:22,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:51:22,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:51:22,613 INFO L87 Difference]: Start difference. First operand 1587 states and 2380 transitions. Second operand 13 states. [2019-12-07 13:51:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:26,414 INFO L93 Difference]: Finished difference Result 7397 states and 11123 transitions. [2019-12-07 13:51:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:51:26,415 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-12-07 13:51:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:26,437 INFO L225 Difference]: With dead ends: 7397 [2019-12-07 13:51:26,437 INFO L226 Difference]: Without dead ends: 5829 [2019-12-07 13:51:26,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:51:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2019-12-07 13:51:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 3417. [2019-12-07 13:51:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-12-07 13:51:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-12-07 13:51:26,524 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 164 [2019-12-07 13:51:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-12-07 13:51:26,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:51:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-12-07 13:51:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 13:51:26,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:26,529 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:26,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:26,730 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:26,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2088210405, now seen corresponding path program 1 times [2019-12-07 13:51:26,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:26,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768729524] [2019-12-07 13:51:26,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:26,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768729524] [2019-12-07 13:51:26,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:26,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:26,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495463436] [2019-12-07 13:51:26,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:26,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:26,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:26,792 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-12-07 13:51:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:27,146 INFO L93 Difference]: Finished difference Result 7163 states and 10994 transitions. [2019-12-07 13:51:27,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:27,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-12-07 13:51:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:27,160 INFO L225 Difference]: With dead ends: 7163 [2019-12-07 13:51:27,160 INFO L226 Difference]: Without dead ends: 3765 [2019-12-07 13:51:27,162 INFO L630 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 [2019-12-07 13:51:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2019-12-07 13:51:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3417. [2019-12-07 13:51:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-12-07 13:51:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5259 transitions. [2019-12-07 13:51:27,223 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5259 transitions. Word has length 177 [2019-12-07 13:51:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:27,224 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5259 transitions. [2019-12-07 13:51:27,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5259 transitions. [2019-12-07 13:51:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 13:51:27,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:27,227 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-12-07 13:51:27,227 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2093282790, now seen corresponding path program 1 times [2019-12-07 13:51:27,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:27,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767671846] [2019-12-07 13:51:27,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 13:51:27,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767671846] [2019-12-07 13:51:27,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:27,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:27,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866521140] [2019-12-07 13:51:27,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:27,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:27,287 INFO L87 Difference]: Start difference. First operand 3417 states and 5259 transitions. Second operand 4 states. [2019-12-07 13:51:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:27,707 INFO L93 Difference]: Finished difference Result 7981 states and 12279 transitions. [2019-12-07 13:51:27,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:27,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-12-07 13:51:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:27,714 INFO L225 Difference]: With dead ends: 7981 [2019-12-07 13:51:27,714 INFO L226 Difference]: Without dead ends: 4583 [2019-12-07 13:51:27,716 INFO L630 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 [2019-12-07 13:51:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-12-07 13:51:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 3885. [2019-12-07 13:51:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-12-07 13:51:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6111 transitions. [2019-12-07 13:51:27,781 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6111 transitions. Word has length 178 [2019-12-07 13:51:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:27,781 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6111 transitions. [2019-12-07 13:51:27,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6111 transitions. [2019-12-07 13:51:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 13:51:27,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:27,785 INFO L410 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] [2019-12-07 13:51:27,785 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1031578742, now seen corresponding path program 1 times [2019-12-07 13:51:27,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:27,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459466296] [2019-12-07 13:51:27,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:27,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459466296] [2019-12-07 13:51:27,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:27,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:27,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405615136] [2019-12-07 13:51:27,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:27,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:27,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:27,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:27,838 INFO L87 Difference]: Start difference. First operand 3885 states and 6111 transitions. Second operand 4 states. [2019-12-07 13:51:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:28,150 INFO L93 Difference]: Finished difference Result 6227 states and 9705 transitions. [2019-12-07 13:51:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:28,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-12-07 13:51:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:28,156 INFO L225 Difference]: With dead ends: 6227 [2019-12-07 13:51:28,156 INFO L226 Difference]: Without dead ends: 4233 [2019-12-07 13:51:28,158 INFO L630 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 [2019-12-07 13:51:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-12-07 13:51:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 3885. [2019-12-07 13:51:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-12-07 13:51:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6099 transitions. [2019-12-07 13:51:28,213 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6099 transitions. Word has length 178 [2019-12-07 13:51:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:28,213 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6099 transitions. [2019-12-07 13:51:28,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6099 transitions. [2019-12-07 13:51:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 13:51:28,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:28,217 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-12-07 13:51:28,217 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -474621622, now seen corresponding path program 1 times [2019-12-07 13:51:28,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:28,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45612467] [2019-12-07 13:51:28,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 13:51:28,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45612467] [2019-12-07 13:51:28,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:28,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:28,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097747078] [2019-12-07 13:51:28,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:28,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:28,283 INFO L87 Difference]: Start difference. First operand 3885 states and 6099 transitions. Second operand 4 states. [2019-12-07 13:51:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:28,655 INFO L93 Difference]: Finished difference Result 8399 states and 13032 transitions. [2019-12-07 13:51:28,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:28,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-12-07 13:51:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:28,661 INFO L225 Difference]: With dead ends: 8399 [2019-12-07 13:51:28,661 INFO L226 Difference]: Without dead ends: 4533 [2019-12-07 13:51:28,664 INFO L630 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 [2019-12-07 13:51:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-12-07 13:51:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3765. [2019-12-07 13:51:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-12-07 13:51:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5871 transitions. [2019-12-07 13:51:28,723 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5871 transitions. Word has length 179 [2019-12-07 13:51:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:28,723 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5871 transitions. [2019-12-07 13:51:28,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5871 transitions. [2019-12-07 13:51:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 13:51:28,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:28,727 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 13:51:28,728 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2087807271, now seen corresponding path program 1 times [2019-12-07 13:51:28,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:28,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416663064] [2019-12-07 13:51:28,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 13:51:28,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416663064] [2019-12-07 13:51:28,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:28,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:51:28,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887752791] [2019-12-07 13:51:28,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:51:28,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:28,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:51:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:51:28,818 INFO L87 Difference]: Start difference. First operand 3765 states and 5871 transitions. Second operand 5 states. [2019-12-07 13:51:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:29,237 INFO L93 Difference]: Finished difference Result 9049 states and 14119 transitions. [2019-12-07 13:51:29,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:29,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-12-07 13:51:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:29,243 INFO L225 Difference]: With dead ends: 9049 [2019-12-07 13:51:29,243 INFO L226 Difference]: Without dead ends: 5303 [2019-12-07 13:51:29,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2019-12-07 13:51:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 4239. [2019-12-07 13:51:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-12-07 13:51:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6729 transitions. [2019-12-07 13:51:29,314 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6729 transitions. Word has length 179 [2019-12-07 13:51:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:29,314 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6729 transitions. [2019-12-07 13:51:29,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:51:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6729 transitions. [2019-12-07 13:51:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 13:51:29,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:29,319 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 13:51:29,319 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash -728365523, now seen corresponding path program 2 times [2019-12-07 13:51:29,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:29,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558170219] [2019-12-07 13:51:29,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 13:51:29,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558170219] [2019-12-07 13:51:29,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:29,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:29,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079639776] [2019-12-07 13:51:29,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:29,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:29,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:29,365 INFO L87 Difference]: Start difference. First operand 4239 states and 6729 transitions. Second operand 4 states. [2019-12-07 13:51:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:29,768 INFO L93 Difference]: Finished difference Result 7579 states and 11932 transitions. [2019-12-07 13:51:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:29,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-12-07 13:51:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:29,773 INFO L225 Difference]: With dead ends: 7579 [2019-12-07 13:51:29,773 INFO L226 Difference]: Without dead ends: 5405 [2019-12-07 13:51:29,775 INFO L630 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 [2019-12-07 13:51:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-12-07 13:51:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4383. [2019-12-07 13:51:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-12-07 13:51:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6933 transitions. [2019-12-07 13:51:29,845 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6933 transitions. Word has length 179 [2019-12-07 13:51:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:29,845 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6933 transitions. [2019-12-07 13:51:29,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6933 transitions. [2019-12-07 13:51:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 13:51:29,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:29,849 INFO L410 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] [2019-12-07 13:51:29,849 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1570855393, now seen corresponding path program 1 times [2019-12-07 13:51:29,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:29,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520774820] [2019-12-07 13:51:29,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:29,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520774820] [2019-12-07 13:51:29,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:29,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:29,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955720485] [2019-12-07 13:51:29,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:29,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:29,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:29,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:29,899 INFO L87 Difference]: Start difference. First operand 4383 states and 6933 transitions. Second operand 4 states. [2019-12-07 13:51:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:30,231 INFO L93 Difference]: Finished difference Result 6977 states and 10941 transitions. [2019-12-07 13:51:30,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:30,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-12-07 13:51:30,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:30,235 INFO L225 Difference]: With dead ends: 6977 [2019-12-07 13:51:30,235 INFO L226 Difference]: Without dead ends: 4731 [2019-12-07 13:51:30,237 INFO L630 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 [2019-12-07 13:51:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-12-07 13:51:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4383. [2019-12-07 13:51:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-12-07 13:51:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6921 transitions. [2019-12-07 13:51:30,305 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6921 transitions. Word has length 179 [2019-12-07 13:51:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:30,305 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6921 transitions. [2019-12-07 13:51:30,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6921 transitions. [2019-12-07 13:51:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 13:51:30,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:30,309 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 13:51:30,309 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1414237136, now seen corresponding path program 1 times [2019-12-07 13:51:30,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:30,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246649682] [2019-12-07 13:51:30,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 13:51:30,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246649682] [2019-12-07 13:51:30,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:30,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:30,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048607510] [2019-12-07 13:51:30,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:30,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:30,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:30,369 INFO L87 Difference]: Start difference. First operand 4383 states and 6921 transitions. Second operand 4 states. [2019-12-07 13:51:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:30,789 INFO L93 Difference]: Finished difference Result 7651 states and 12004 transitions. [2019-12-07 13:51:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:30,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-12-07 13:51:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:30,794 INFO L225 Difference]: With dead ends: 7651 [2019-12-07 13:51:30,794 INFO L226 Difference]: Without dead ends: 5405 [2019-12-07 13:51:30,796 INFO L630 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 [2019-12-07 13:51:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-12-07 13:51:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4395. [2019-12-07 13:51:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-12-07 13:51:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6933 transitions. [2019-12-07 13:51:30,862 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6933 transitions. Word has length 180 [2019-12-07 13:51:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:30,862 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6933 transitions. [2019-12-07 13:51:30,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6933 transitions. [2019-12-07 13:51:30,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 13:51:30,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:30,866 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-12-07 13:51:30,867 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash -304880533, now seen corresponding path program 1 times [2019-12-07 13:51:30,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:30,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537732957] [2019-12-07 13:51:30,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 13:51:30,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537732957] [2019-12-07 13:51:30,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:30,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:51:30,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769550422] [2019-12-07 13:51:30,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:51:30,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:30,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:51:30,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:51:30,946 INFO L87 Difference]: Start difference. First operand 4395 states and 6933 transitions. Second operand 5 states. [2019-12-07 13:51:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:31,392 INFO L93 Difference]: Finished difference Result 9973 states and 15697 transitions. [2019-12-07 13:51:31,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:31,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-12-07 13:51:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:31,397 INFO L225 Difference]: With dead ends: 9973 [2019-12-07 13:51:31,397 INFO L226 Difference]: Without dead ends: 5597 [2019-12-07 13:51:31,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-12-07 13:51:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4263. [2019-12-07 13:51:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-12-07 13:51:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6753 transitions. [2019-12-07 13:51:31,469 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6753 transitions. Word has length 180 [2019-12-07 13:51:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:31,469 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6753 transitions. [2019-12-07 13:51:31,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:51:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6753 transitions. [2019-12-07 13:51:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 13:51:31,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:31,473 INFO L410 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] [2019-12-07 13:51:31,474 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1891043653, now seen corresponding path program 1 times [2019-12-07 13:51:31,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:31,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986080953] [2019-12-07 13:51:31,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:31,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986080953] [2019-12-07 13:51:31,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:31,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:31,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582788423] [2019-12-07 13:51:31,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:31,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:31,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:31,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:31,531 INFO L87 Difference]: Start difference. First operand 4263 states and 6753 transitions. Second operand 4 states. [2019-12-07 13:51:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:31,880 INFO L93 Difference]: Finished difference Result 6797 states and 10671 transitions. [2019-12-07 13:51:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:31,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-12-07 13:51:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:31,884 INFO L225 Difference]: With dead ends: 6797 [2019-12-07 13:51:31,885 INFO L226 Difference]: Without dead ends: 4611 [2019-12-07 13:51:31,886 INFO L630 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 [2019-12-07 13:51:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2019-12-07 13:51:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4263. [2019-12-07 13:51:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-12-07 13:51:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6741 transitions. [2019-12-07 13:51:31,969 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6741 transitions. Word has length 180 [2019-12-07 13:51:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:31,969 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6741 transitions. [2019-12-07 13:51:31,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6741 transitions. [2019-12-07 13:51:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 13:51:31,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:31,973 INFO L410 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, 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] [2019-12-07 13:51:31,973 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:31,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1166712722, now seen corresponding path program 1 times [2019-12-07 13:51:31,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:31,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101265934] [2019-12-07 13:51:31,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 13:51:32,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101265934] [2019-12-07 13:51:32,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:32,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:32,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074424443] [2019-12-07 13:51:32,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:32,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:32,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:32,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:32,019 INFO L87 Difference]: Start difference. First operand 4263 states and 6741 transitions. Second operand 4 states. [2019-12-07 13:51:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:32,415 INFO L93 Difference]: Finished difference Result 7409 states and 11635 transitions. [2019-12-07 13:51:32,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:32,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-12-07 13:51:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:32,419 INFO L225 Difference]: With dead ends: 7409 [2019-12-07 13:51:32,419 INFO L226 Difference]: Without dead ends: 5223 [2019-12-07 13:51:32,421 INFO L630 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 [2019-12-07 13:51:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2019-12-07 13:51:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 4275. [2019-12-07 13:51:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-12-07 13:51:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6753 transitions. [2019-12-07 13:51:32,490 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6753 transitions. Word has length 181 [2019-12-07 13:51:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:32,490 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6753 transitions. [2019-12-07 13:51:32,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6753 transitions. [2019-12-07 13:51:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 13:51:32,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:32,494 INFO L410 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] [2019-12-07 13:51:32,494 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 181086524, now seen corresponding path program 1 times [2019-12-07 13:51:32,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:32,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627942070] [2019-12-07 13:51:32,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:32,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627942070] [2019-12-07 13:51:32,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:32,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:32,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058720358] [2019-12-07 13:51:32,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:32,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:32,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:32,549 INFO L87 Difference]: Start difference. First operand 4275 states and 6753 transitions. Second operand 4 states. [2019-12-07 13:51:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:32,859 INFO L93 Difference]: Finished difference Result 6755 states and 10599 transitions. [2019-12-07 13:51:32,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:32,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-12-07 13:51:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:32,862 INFO L225 Difference]: With dead ends: 6755 [2019-12-07 13:51:32,862 INFO L226 Difference]: Without dead ends: 4563 [2019-12-07 13:51:32,864 INFO L630 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 [2019-12-07 13:51:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2019-12-07 13:51:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 4275. [2019-12-07 13:51:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-12-07 13:51:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6741 transitions. [2019-12-07 13:51:32,931 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6741 transitions. Word has length 181 [2019-12-07 13:51:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:32,931 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6741 transitions. [2019-12-07 13:51:32,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6741 transitions. [2019-12-07 13:51:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 13:51:32,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:32,935 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 13:51:32,935 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:32,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1939913077, now seen corresponding path program 1 times [2019-12-07 13:51:32,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:32,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613401944] [2019-12-07 13:51:32,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 13:51:32,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613401944] [2019-12-07 13:51:32,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:32,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:32,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567070826] [2019-12-07 13:51:32,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:32,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:32,988 INFO L87 Difference]: Start difference. First operand 4275 states and 6741 transitions. Second operand 4 states. [2019-12-07 13:51:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:33,374 INFO L93 Difference]: Finished difference Result 7355 states and 11539 transitions. [2019-12-07 13:51:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:33,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-12-07 13:51:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:33,377 INFO L225 Difference]: With dead ends: 7355 [2019-12-07 13:51:33,377 INFO L226 Difference]: Without dead ends: 5163 [2019-12-07 13:51:33,379 INFO L630 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 [2019-12-07 13:51:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-12-07 13:51:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4287. [2019-12-07 13:51:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 13:51:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-12-07 13:51:33,452 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 182 [2019-12-07 13:51:33,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:33,452 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-12-07 13:51:33,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-12-07 13:51:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 13:51:33,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:33,457 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 13:51:33,457 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash 298033814, now seen corresponding path program 1 times [2019-12-07 13:51:33,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:33,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596950445] [2019-12-07 13:51:33,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:33,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596950445] [2019-12-07 13:51:33,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:33,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:33,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510762348] [2019-12-07 13:51:33,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:33,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:33,505 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-12-07 13:51:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:33,830 INFO L93 Difference]: Finished difference Result 8843 states and 13886 transitions. [2019-12-07 13:51:33,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:33,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-12-07 13:51:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:33,834 INFO L225 Difference]: With dead ends: 8843 [2019-12-07 13:51:33,834 INFO L226 Difference]: Without dead ends: 4575 [2019-12-07 13:51:33,837 INFO L630 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 [2019-12-07 13:51:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-07 13:51:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-12-07 13:51:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 13:51:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6741 transitions. [2019-12-07 13:51:33,907 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6741 transitions. Word has length 185 [2019-12-07 13:51:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:33,907 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6741 transitions. [2019-12-07 13:51:33,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6741 transitions. [2019-12-07 13:51:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 13:51:33,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:33,910 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1] [2019-12-07 13:51:33,910 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 104383426, now seen corresponding path program 1 times [2019-12-07 13:51:33,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:33,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145812422] [2019-12-07 13:51:33,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:33,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145812422] [2019-12-07 13:51:33,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:33,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:33,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659048673] [2019-12-07 13:51:33,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:33,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:33,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:33,966 INFO L87 Difference]: Start difference. First operand 4287 states and 6741 transitions. Second operand 4 states. [2019-12-07 13:51:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:34,277 INFO L93 Difference]: Finished difference Result 8843 states and 13862 transitions. [2019-12-07 13:51:34,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:34,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-12-07 13:51:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:34,280 INFO L225 Difference]: With dead ends: 8843 [2019-12-07 13:51:34,280 INFO L226 Difference]: Without dead ends: 4575 [2019-12-07 13:51:34,283 INFO L630 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 [2019-12-07 13:51:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-07 13:51:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-12-07 13:51:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 13:51:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6729 transitions. [2019-12-07 13:51:34,357 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6729 transitions. Word has length 185 [2019-12-07 13:51:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:34,357 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6729 transitions. [2019-12-07 13:51:34,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6729 transitions. [2019-12-07 13:51:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 13:51:34,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:34,359 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:34,359 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash -556828801, now seen corresponding path program 1 times [2019-12-07 13:51:34,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:34,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741530779] [2019-12-07 13:51:34,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:34,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741530779] [2019-12-07 13:51:34,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:34,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:34,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312230210] [2019-12-07 13:51:34,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:34,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:34,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:34,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:34,409 INFO L87 Difference]: Start difference. First operand 4287 states and 6729 transitions. Second operand 4 states. [2019-12-07 13:51:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:34,753 INFO L93 Difference]: Finished difference Result 8795 states and 13772 transitions. [2019-12-07 13:51:34,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:34,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 13:51:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:34,756 INFO L225 Difference]: With dead ends: 8795 [2019-12-07 13:51:34,756 INFO L226 Difference]: Without dead ends: 4527 [2019-12-07 13:51:34,759 INFO L630 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 [2019-12-07 13:51:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2019-12-07 13:51:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4287. [2019-12-07 13:51:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 13:51:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6717 transitions. [2019-12-07 13:51:34,829 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6717 transitions. Word has length 186 [2019-12-07 13:51:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:34,829 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6717 transitions. [2019-12-07 13:51:34,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6717 transitions. [2019-12-07 13:51:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 13:51:34,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:34,831 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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] [2019-12-07 13:51:34,831 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash -829120181, now seen corresponding path program 1 times [2019-12-07 13:51:34,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:34,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618195317] [2019-12-07 13:51:34,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:34,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618195317] [2019-12-07 13:51:34,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:34,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:34,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76155611] [2019-12-07 13:51:34,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:34,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:34,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:34,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:34,881 INFO L87 Difference]: Start difference. First operand 4287 states and 6717 transitions. Second operand 4 states. [2019-12-07 13:51:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:35,176 INFO L93 Difference]: Finished difference Result 8735 states and 13670 transitions. [2019-12-07 13:51:35,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:35,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 13:51:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:35,179 INFO L225 Difference]: With dead ends: 8735 [2019-12-07 13:51:35,179 INFO L226 Difference]: Without dead ends: 4467 [2019-12-07 13:51:35,181 INFO L630 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 [2019-12-07 13:51:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2019-12-07 13:51:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4287. [2019-12-07 13:51:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 13:51:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6705 transitions. [2019-12-07 13:51:35,255 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6705 transitions. Word has length 186 [2019-12-07 13:51:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:35,255 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6705 transitions. [2019-12-07 13:51:35,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6705 transitions. [2019-12-07 13:51:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 13:51:35,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:35,257 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:35,257 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 127197068, now seen corresponding path program 1 times [2019-12-07 13:51:35,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:35,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969939616] [2019-12-07 13:51:35,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 13:51:35,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969939616] [2019-12-07 13:51:35,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:35,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:35,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682611108] [2019-12-07 13:51:35,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:35,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:35,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:35,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:35,312 INFO L87 Difference]: Start difference. First operand 4287 states and 6705 transitions. Second operand 4 states. [2019-12-07 13:51:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:35,673 INFO L93 Difference]: Finished difference Result 9299 states and 14546 transitions. [2019-12-07 13:51:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:35,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-12-07 13:51:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:35,676 INFO L225 Difference]: With dead ends: 9299 [2019-12-07 13:51:35,676 INFO L226 Difference]: Without dead ends: 5031 [2019-12-07 13:51:35,678 INFO L630 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 [2019-12-07 13:51:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2019-12-07 13:51:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 4647. [2019-12-07 13:51:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-12-07 13:51:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7341 transitions. [2019-12-07 13:51:35,756 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7341 transitions. Word has length 188 [2019-12-07 13:51:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:35,757 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7341 transitions. [2019-12-07 13:51:35,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7341 transitions. [2019-12-07 13:51:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 13:51:35,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:35,759 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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] [2019-12-07 13:51:35,759 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1739670347, now seen corresponding path program 1 times [2019-12-07 13:51:35,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:35,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820200469] [2019-12-07 13:51:35,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 13:51:35,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820200469] [2019-12-07 13:51:35,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:35,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:35,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478953781] [2019-12-07 13:51:35,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:35,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:35,807 INFO L87 Difference]: Start difference. First operand 4647 states and 7341 transitions. Second operand 4 states. [2019-12-07 13:51:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:36,184 INFO L93 Difference]: Finished difference Result 9455 states and 14918 transitions. [2019-12-07 13:51:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:36,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-12-07 13:51:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:36,188 INFO L225 Difference]: With dead ends: 9455 [2019-12-07 13:51:36,188 INFO L226 Difference]: Without dead ends: 4827 [2019-12-07 13:51:36,190 INFO L630 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 [2019-12-07 13:51:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2019-12-07 13:51:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4647. [2019-12-07 13:51:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-12-07 13:51:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7329 transitions. [2019-12-07 13:51:36,266 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7329 transitions. Word has length 190 [2019-12-07 13:51:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:36,266 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7329 transitions. [2019-12-07 13:51:36,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7329 transitions. [2019-12-07 13:51:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 13:51:36,268 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:36,268 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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] [2019-12-07 13:51:36,269 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 55283532, now seen corresponding path program 1 times [2019-12-07 13:51:36,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:36,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654079697] [2019-12-07 13:51:36,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 13:51:36,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654079697] [2019-12-07 13:51:36,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:36,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:36,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425329049] [2019-12-07 13:51:36,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:36,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:36,324 INFO L87 Difference]: Start difference. First operand 4647 states and 7329 transitions. Second operand 4 states. [2019-12-07 13:51:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:36,794 INFO L93 Difference]: Finished difference Result 9431 states and 14870 transitions. [2019-12-07 13:51:36,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:36,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-12-07 13:51:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:36,798 INFO L225 Difference]: With dead ends: 9431 [2019-12-07 13:51:36,798 INFO L226 Difference]: Without dead ends: 4803 [2019-12-07 13:51:36,800 INFO L630 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 [2019-12-07 13:51:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2019-12-07 13:51:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4647. [2019-12-07 13:51:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-12-07 13:51:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7317 transitions. [2019-12-07 13:51:36,878 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7317 transitions. Word has length 191 [2019-12-07 13:51:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:36,878 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7317 transitions. [2019-12-07 13:51:36,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7317 transitions. [2019-12-07 13:51:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 13:51:36,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:36,880 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2019-12-07 13:51:36,881 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:36,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:36,881 INFO L82 PathProgramCache]: Analyzing trace with hash -24309129, now seen corresponding path program 1 times [2019-12-07 13:51:36,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:36,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464993780] [2019-12-07 13:51:36,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 13:51:36,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464993780] [2019-12-07 13:51:36,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:36,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:36,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205609890] [2019-12-07 13:51:36,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:36,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:36,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:36,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:36,929 INFO L87 Difference]: Start difference. First operand 4647 states and 7317 transitions. Second operand 4 states. [2019-12-07 13:51:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:37,316 INFO L93 Difference]: Finished difference Result 10151 states and 15948 transitions. [2019-12-07 13:51:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:37,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-12-07 13:51:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:37,320 INFO L225 Difference]: With dead ends: 10151 [2019-12-07 13:51:37,320 INFO L226 Difference]: Without dead ends: 5523 [2019-12-07 13:51:37,322 INFO L630 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 [2019-12-07 13:51:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2019-12-07 13:51:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4659. [2019-12-07 13:51:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-07 13:51:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 7329 transitions. [2019-12-07 13:51:37,404 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 7329 transitions. Word has length 192 [2019-12-07 13:51:37,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:37,404 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 7329 transitions. [2019-12-07 13:51:37,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 7329 transitions. [2019-12-07 13:51:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:51:37,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:37,406 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-12-07 13:51:37,406 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash -269316076, now seen corresponding path program 1 times [2019-12-07 13:51:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528513688] [2019-12-07 13:51:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 13:51:37,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528513688] [2019-12-07 13:51:37,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:37,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:37,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138300051] [2019-12-07 13:51:37,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:37,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:37,455 INFO L87 Difference]: Start difference. First operand 4659 states and 7329 transitions. Second operand 4 states. [2019-12-07 13:51:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:37,858 INFO L93 Difference]: Finished difference Result 10139 states and 15924 transitions. [2019-12-07 13:51:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:37,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-12-07 13:51:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:37,862 INFO L225 Difference]: With dead ends: 10139 [2019-12-07 13:51:37,862 INFO L226 Difference]: Without dead ends: 5499 [2019-12-07 13:51:37,864 INFO L630 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 [2019-12-07 13:51:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2019-12-07 13:51:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4671. [2019-12-07 13:51:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2019-12-07 13:51:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7341 transitions. [2019-12-07 13:51:37,947 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 7341 transitions. Word has length 193 [2019-12-07 13:51:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:37,947 INFO L462 AbstractCegarLoop]: Abstraction has 4671 states and 7341 transitions. [2019-12-07 13:51:37,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 7341 transitions. [2019-12-07 13:51:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:51:37,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:37,949 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2019-12-07 13:51:37,949 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:37,950 INFO L82 PathProgramCache]: Analyzing trace with hash 885688148, now seen corresponding path program 1 times [2019-12-07 13:51:37,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:37,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519652891] [2019-12-07 13:51:37,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 13:51:37,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519652891] [2019-12-07 13:51:37,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:37,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:51:37,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948598928] [2019-12-07 13:51:37,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:37,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:51:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:37,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:37,995 INFO L87 Difference]: Start difference. First operand 4671 states and 7341 transitions. Second operand 4 states. [2019-12-07 13:51:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:38,421 INFO L93 Difference]: Finished difference Result 8177 states and 12775 transitions. [2019-12-07 13:51:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:38,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-12-07 13:51:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:38,425 INFO L225 Difference]: With dead ends: 8177 [2019-12-07 13:51:38,425 INFO L226 Difference]: Without dead ends: 5787 [2019-12-07 13:51:38,427 INFO L630 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 [2019-12-07 13:51:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2019-12-07 13:51:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 4815. [2019-12-07 13:51:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2019-12-07 13:51:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 7545 transitions. [2019-12-07 13:51:38,513 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 7545 transitions. Word has length 193 [2019-12-07 13:51:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:38,513 INFO L462 AbstractCegarLoop]: Abstraction has 4815 states and 7545 transitions. [2019-12-07 13:51:38,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 7545 transitions. [2019-12-07 13:51:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 13:51:38,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:38,516 INFO L410 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] [2019-12-07 13:51:38,516 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash 990290520, now seen corresponding path program 1 times [2019-12-07 13:51:38,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:51:38,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025317593] [2019-12-07 13:51:38,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:51:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:51:38,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:51:38,687 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:51:38,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:51:38 BoogieIcfgContainer [2019-12-07 13:51:38,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:51:38,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:51:38,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:51:38,780 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:51:38,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:03" (3/4) ... [2019-12-07 13:51:38,783 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:51:38,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:51:38,784 INFO L168 Benchmark]: Toolchain (without parser) took 36107.58 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 599.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 476.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:38,784 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:51:38,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:38,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:51:38,784 INFO L168 Benchmark]: Boogie Preprocessor took 53.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:38,784 INFO L168 Benchmark]: RCFGBuilder took 670.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.8 MB in the end (delta: 93.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:38,785 INFO L168 Benchmark]: TraceAbstraction took 34905.58 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 502.8 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:38,785 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:51:38,786 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -126.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 670.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.8 MB in the end (delta: 93.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34905.58 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 502.8 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1727]: 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 [init=1, SSLv3_server_data={6: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)) [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 [init=1, SSLv3_server_data={6:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND TRUE s->state == 8656 [L1579] EXPR s->session [L1579] EXPR s->s3 [L1579] EXPR (s->s3)->tmp.new_cipher [L1579] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1592] COND FALSE !(ret <= 0) [L1597] s->state = 8672 [L1598] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1599] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [init=1, SSLv3_server_data={6:0}] [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={6:0}] [L1727] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 34.7s, OverallIterations: 71, TraceHistogramMax: 8, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15246 SDtfs, 5635 SDslu, 23781 SDs, 0 SdLazy, 15786 SolverSat, 872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 304 SyntacticMatches, 34 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4815occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 70 MinimizatonAttempts, 17523 StatesRemovedByMinimization, 68 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 8375 NumberOfCodeBlocks, 8375 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 8111 ConstructedInterpolants, 80 QuantifiedInterpolants, 4038058 SizeOfPredicates, 11 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 71 InterpolantComputations, 69 PerfectInterpolantSequences, 9387/9629 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.25-f470102 [2019-12-07 13:51:40,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:51:40,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:51:40,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:51:40,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:51:40,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:51:40,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:51:40,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:51:40,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:51:40,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:51:40,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:51:40,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:51:40,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:51:40,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:51:40,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:51:40,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:51:40,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:51:40,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:51:40,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:51:40,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:51:40,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:51:40,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:51:40,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:51:40,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:51:40,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:51:40,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:51:40,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:51:40,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:51:40,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:51:40,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:51:40,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:51:40,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:51:40,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:51:40,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:51:40,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:51:40,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:51:40,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:51:40,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:51:40,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:51:40,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:51:40,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:51:40,137 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 13:51:40,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:51:40,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:51:40,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:51:40,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:51:40,148 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:51:40,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:51:40,149 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:51:40,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:51:40,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:51:40,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:51:40,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:51:40,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:51:40,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:51:40,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:51:40,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:51:40,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:51:40,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:51:40,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:51:40,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:51:40,151 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 13:51:40,151 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:51:40,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:51:40,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:51:40,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:51:40,152 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17194510d9b99ec25b25421f731ec156f7460313 [2019-12-07 13:51:40,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:51:40,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:51:40,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:51:40,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:51:40,329 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:51:40,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-12-07 13:51:40,366 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/a4b722e6e/9cc3bf27d0d64bb188a28aaf3de94676/FLAG11aa1fb58 [2019-12-07 13:51:40,854 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:51:40,855 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-12-07 13:51:40,868 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/a4b722e6e/9cc3bf27d0d64bb188a28aaf3de94676/FLAG11aa1fb58 [2019-12-07 13:51:41,144 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/data/a4b722e6e/9cc3bf27d0d64bb188a28aaf3de94676 [2019-12-07 13:51:41,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:51:41,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:51:41,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:51:41,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:51:41,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:51:41,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411fde5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41, skipping insertion in model container [2019-12-07 13:51:41,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:51:41,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:51:41,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:51:41,490 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:51:41,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:51:41,573 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:51:41,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41 WrapperNode [2019-12-07 13:51:41,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:51:41,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:51:41,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:51:41,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:51:41,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:51:41,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:51:41,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:51:41,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:51:41,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... [2019-12-07 13:51:41,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:51:41,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:51:41,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:51:41,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:51:41,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/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 [2019-12-07 13:51:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:51:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:51:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 13:51:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:51:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:51:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:51:41,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:51:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 13:51:41,853 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:51:43,618 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 13:51:43,618 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 13:51:43,619 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:51:43,619 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:51:43,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:43 BoogieIcfgContainer [2019-12-07 13:51:43,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:51:43,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:51:43,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:51:43,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:51:43,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:51:41" (1/3) ... [2019-12-07 13:51:43,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6631c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:51:43, skipping insertion in model container [2019-12-07 13:51:43,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:41" (2/3) ... [2019-12-07 13:51:43,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6631c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:51:43, skipping insertion in model container [2019-12-07 13:51:43,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:43" (3/3) ... [2019-12-07 13:51:43,625 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-12-07 13:51:43,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:51:43,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:51:43,646 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:51:43,664 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:51:43,664 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:51:43,664 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:51:43,664 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:51:43,664 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:51:43,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:51:43,665 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:51:43,665 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:51:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 13:51:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 13:51:43,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:43,684 INFO L410 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] [2019-12-07 13:51:43,685 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-12-07 13:51:43,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:51:43,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121919060] [2019-12-07 13:51:43,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 13:51:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:43,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:51:43,819 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:43,848 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:43,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121919060] [2019-12-07 13:51:43,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:43,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:51:43,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039568639] [2019-12-07 13:51:43,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:43,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:51:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:43,881 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 13:51:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:44,004 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-12-07 13:51:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:44,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 13:51:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:44,021 INFO L225 Difference]: With dead ends: 564 [2019-12-07 13:51:44,021 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 13:51:44,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 13:51:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-12-07 13:51:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 13:51:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-12-07 13:51:44,086 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-12-07 13:51:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:44,086 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-12-07 13:51:44,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-12-07 13:51:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 13:51:44,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:44,090 INFO L410 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] [2019-12-07 13:51:44,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:51:44,291 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1008290477, now seen corresponding path program 1 times [2019-12-07 13:51:44,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:51:44,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814299886] [2019-12-07 13:51:44,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 13:51:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:44,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:51:44,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:44,530 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:44,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814299886] [2019-12-07 13:51:44,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:44,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:51:44,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031506938] [2019-12-07 13:51:44,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:44,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:51:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:44,549 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-12-07 13:51:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:45,817 INFO L93 Difference]: Finished difference Result 878 states and 1351 transitions. [2019-12-07 13:51:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:45,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 13:51:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:45,820 INFO L225 Difference]: With dead ends: 878 [2019-12-07 13:51:45,820 INFO L226 Difference]: Without dead ends: 627 [2019-12-07 13:51:45,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-12-07 13:51:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-12-07 13:51:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-12-07 13:51:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 948 transitions. [2019-12-07 13:51:45,846 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 948 transitions. Word has length 58 [2019-12-07 13:51:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:45,847 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 948 transitions. [2019-12-07 13:51:45,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 948 transitions. [2019-12-07 13:51:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 13:51:45,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:45,852 INFO L410 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] [2019-12-07 13:51:46,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:51:46,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash 647290871, now seen corresponding path program 1 times [2019-12-07 13:51:46,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:51:46,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624659877] [2019-12-07 13:51:46,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 13:51:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:46,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:51:46,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:46,279 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:51:46,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624659877] [2019-12-07 13:51:46,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:46,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:51:46,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403990470] [2019-12-07 13:51:46,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:46,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:51:46,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:46,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:46,302 INFO L87 Difference]: Start difference. First operand 625 states and 948 transitions. Second operand 4 states. [2019-12-07 13:51:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:46,630 INFO L93 Difference]: Finished difference Result 1364 states and 2081 transitions. [2019-12-07 13:51:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:46,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 13:51:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:46,635 INFO L225 Difference]: With dead ends: 1364 [2019-12-07 13:51:46,635 INFO L226 Difference]: Without dead ends: 871 [2019-12-07 13:51:46,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-12-07 13:51:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2019-12-07 13:51:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-12-07 13:51:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1319 transitions. [2019-12-07 13:51:46,661 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1319 transitions. Word has length 110 [2019-12-07 13:51:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:46,662 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1319 transitions. [2019-12-07 13:51:46,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1319 transitions. [2019-12-07 13:51:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 13:51:46,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:46,664 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-12-07 13:51:46,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:51:46,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:46,865 INFO L82 PathProgramCache]: Analyzing trace with hash 349104543, now seen corresponding path program 1 times [2019-12-07 13:51:46,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:51:46,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612037737] [2019-12-07 13:51:46,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 13:51:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:47,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:51:47,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:51:47,045 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:51:47,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612037737] [2019-12-07 13:51:47,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:47,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 13:51:47,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309229304] [2019-12-07 13:51:47,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:47,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:51:47,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:47,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:47,075 INFO L87 Difference]: Start difference. First operand 871 states and 1319 transitions. Second operand 4 states. [2019-12-07 13:51:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:47,648 INFO L93 Difference]: Finished difference Result 1856 states and 2820 transitions. [2019-12-07 13:51:47,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:51:47,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 13:51:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:47,653 INFO L225 Difference]: With dead ends: 1856 [2019-12-07 13:51:47,653 INFO L226 Difference]: Without dead ends: 1117 [2019-12-07 13:51:47,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-07 13:51:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2019-12-07 13:51:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-12-07 13:51:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1686 transitions. [2019-12-07 13:51:47,681 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1686 transitions. Word has length 147 [2019-12-07 13:51:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:47,682 INFO L462 AbstractCegarLoop]: Abstraction has 1117 states and 1686 transitions. [2019-12-07 13:51:47,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1686 transitions. [2019-12-07 13:51:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 13:51:47,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:47,684 INFO L410 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] [2019-12-07 13:51:47,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:51:47,885 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:51:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 959908544, now seen corresponding path program 1 times [2019-12-07 13:51:47,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:51:47,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314053416] [2019-12-07 13:51:47,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 13:51:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:48,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:51:48,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:48,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 13:51:48,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:48,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:48,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:48,215 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 13:51:48,240 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:51:48,240 INFO L377 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 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 13:51:48,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:48,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:48,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:48,248 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 13:51:48,268 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 13:51:48,268 INFO L377 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 28 treesize of output 10 [2019-12-07 13:51:48,268 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:48,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:48,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:48,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 13:51:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 13:51:48,309 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 13:51:48,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314053416] [2019-12-07 13:51:48,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:48,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 13:51:48,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477951999] [2019-12-07 13:51:48,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:51:48,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:51:48,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:51:48,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:51:48,364 INFO L87 Difference]: Start difference. First operand 1117 states and 1686 transitions. Second operand 7 states. [2019-12-07 13:52:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:05,595 INFO L93 Difference]: Finished difference Result 4220 states and 6392 transitions. [2019-12-07 13:52:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:52:05,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 163 [2019-12-07 13:52:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:05,607 INFO L225 Difference]: With dead ends: 4220 [2019-12-07 13:52:05,607 INFO L226 Difference]: Without dead ends: 3111 [2019-12-07 13:52:05,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:52:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2019-12-07 13:52:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 1341. [2019-12-07 13:52:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2019-12-07 13:52:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2072 transitions. [2019-12-07 13:52:05,656 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2072 transitions. Word has length 163 [2019-12-07 13:52:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:05,656 INFO L462 AbstractCegarLoop]: Abstraction has 1341 states and 2072 transitions. [2019-12-07 13:52:05,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:52:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2072 transitions. [2019-12-07 13:52:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 13:52:05,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:05,659 INFO L410 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] [2019-12-07 13:52:05,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:52:05,861 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:52:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1090500354, now seen corresponding path program 1 times [2019-12-07 13:52:05,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:52:05,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795005216] [2019-12-07 13:52:05,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 13:52:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:06,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:52:06,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:06,194 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 13:52:06,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 13:52:06,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:06,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:06,202 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:06,203 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 13:52:06,218 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 13:52:06,218 INFO L377 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 28 treesize of output 10 [2019-12-07 13:52:06,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:06,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:06,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:06,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 13:52:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 13:52:06,246 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 13:52:06,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795005216] [2019-12-07 13:52:06,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:06,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 13:52:06,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638826041] [2019-12-07 13:52:06,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:52:06,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:52:06,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:52:06,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:52:06,279 INFO L87 Difference]: Start difference. First operand 1341 states and 2072 transitions. Second operand 5 states. [2019-12-07 13:52:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:14,592 INFO L93 Difference]: Finished difference Result 3246 states and 5016 transitions. [2019-12-07 13:52:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:52:14,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-12-07 13:52:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:14,601 INFO L225 Difference]: With dead ends: 3246 [2019-12-07 13:52:14,601 INFO L226 Difference]: Without dead ends: 1913 [2019-12-07 13:52:14,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:52:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-12-07 13:52:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1593. [2019-12-07 13:52:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-12-07 13:52:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2513 transitions. [2019-12-07 13:52:14,646 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2513 transitions. Word has length 163 [2019-12-07 13:52:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:14,647 INFO L462 AbstractCegarLoop]: Abstraction has 1593 states and 2513 transitions. [2019-12-07 13:52:14,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:52:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2513 transitions. [2019-12-07 13:52:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 13:52:14,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:14,650 INFO L410 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] [2019-12-07 13:52:14,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 13:52:14,850 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:52:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-12-07 13:52:14,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:52:14,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981990379] [2019-12-07 13:52:14,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 13:52:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:15,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 13:52:15,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:16,456 INFO L237 Elim1Store]: Index analysis took 405 ms [2019-12-07 13:52:16,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:16,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-12-07 13:52:16,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:18,788 WARN L192 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 13:52:18,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:18,792 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_183|, |v_#memory_$Pointer$.offset_184|], 2=[|v_#memory_$Pointer$.base_181|, |v_#memory_$Pointer$.offset_180|, |v_#memory_$Pointer$.offset_181|, |v_#memory_$Pointer$.base_180|]} [2019-12-07 13:52:18,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:18,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:19,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:19,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:19,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:19,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:19,522 INFO L237 Elim1Store]: Index analysis took 619 ms [2019-12-07 13:52:20,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 13:52:20,605 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:22,483 WARN L192 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 13:52:22,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:22,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:22,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:22,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:22,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:22,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:22,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:22,746 INFO L237 Elim1Store]: Index analysis took 213 ms [2019-12-07 13:52:22,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 13:52:22,949 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:23,806 WARN L192 SmtUtils]: Spent 857.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 13:52:23,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:23,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:23,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:23,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:23,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:23,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:23,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 47 treesize of output 37 [2019-12-07 13:52:24,008 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:24,457 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 13:52:24,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:24,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 47 treesize of output 37 [2019-12-07 13:52:24,532 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:24,700 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 13:52:24,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:24,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 47 treesize of output 37 [2019-12-07 13:52:24,725 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:24,825 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 13:52:24,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:24,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 47 treesize of output 37 [2019-12-07 13:52:24,843 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:24,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:24,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:24,889 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:91 [2019-12-07 13:52:24,922 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_185|], 12=[|v_#memory_$Pointer$.base_184|]} [2019-12-07 13:52:24,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:24,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 13:52:24,936 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:52:25,008 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,034 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,034 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:52:25,038 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_186|], 12=[|v_#memory_$Pointer$.base_185|]} [2019-12-07 13:52:25,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 13:52:25,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:52:25,111 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,135 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,135 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:52:25,138 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_182|, |v_#memory_$Pointer$.offset_182|, |v_#memory_$Pointer$.offset_187|], 12=[|v_#memory_$Pointer$.base_186|]} [2019-12-07 13:52:25,146 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:25,376 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 13:52:25,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,385 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:25,538 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 13:52:25,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,575 INFO L377 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 34 treesize of output 22 [2019-12-07 13:52:25,575 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,705 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 13:52:25,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2019-12-07 13:52:25,718 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,751 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,751 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:91 [2019-12-07 13:52:25,756 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_188|], 12=[|v_#memory_$Pointer$.base_187|]} [2019-12-07 13:52:25,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 13:52:25,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:52:25,830 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,853 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:52:25,856 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_189|], 12=[|v_#memory_$Pointer$.base_188|]} [2019-12-07 13:52:25,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 13:52:25,870 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 13:52:25,944 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:25,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:25,968 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:52:25,978 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_189|], 12=[|v_#memory_$Pointer$.offset_190|]} [2019-12-07 13:52:25,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:25,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 56 [2019-12-07 13:52:25,984 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-12-07 13:52:26,015 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,037 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,037 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:52 [2019-12-07 13:52:26,072 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_183|], 20=[|v_#memory_$Pointer$.offset_191|]} [2019-12-07 13:52:26,076 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-12-07 13:52:26,155 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,181 INFO L534 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. [2019-12-07 13:52:26,181 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:44 [2019-12-07 13:52:26,223 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_203|], 20=[|v_#memory_$Pointer$.offset_192|]} [2019-12-07 13:52:26,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-12-07 13:52:26,233 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2019-12-07 13:52:26,290 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,316 INFO L534 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. [2019-12-07 13:52:26,317 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:61 [2019-12-07 13:52:26,355 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_190|], 2=[|v_#memory_int_204|], 12=[|v_#memory_$Pointer$.offset_193|]} [2019-12-07 13:52:26,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 [2019-12-07 13:52:26,367 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,414 INFO L377 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 29 treesize of output 28 [2019-12-07 13:52:26,414 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 26 [2019-12-07 13:52:26,454 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,469 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:92, output treesize:22 [2019-12-07 13:52:26,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:52:26,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,500 INFO L377 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 13:52:26,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,510 INFO L534 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. [2019-12-07 13:52:26,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-12-07 13:52:26,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 15 [2019-12-07 13:52:26,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-12-07 13:52:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 13:52:26,772 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:26,811 INFO L377 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 37 treesize of output 25 [2019-12-07 13:52:26,811 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,816 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-12-07 13:52:26,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:26,875 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,878 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,886 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,886 INFO L534 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. [2019-12-07 13:52:26,886 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:17 [2019-12-07 13:52:26,923 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_197|], 2=[|v_#memory_$Pointer$.offset_183|]} [2019-12-07 13:52:26,925 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,938 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:26,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:26,942 INFO L534 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. [2019-12-07 13:52:26,942 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-12-07 13:52:27,046 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_196|], 20=[|v_#memory_$Pointer$.offset_199|]} [2019-12-07 13:52:27,049 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:27,079 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:27,080 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:27,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:27,089 INFO L534 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. [2019-12-07 13:52:27,090 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-12-07 13:52:29,177 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_197|], 1=[|v_#memory_$Pointer$.offset_200|]} [2019-12-07 13:52:29,180 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:29,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:29,229 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:29,244 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:29,245 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:29,245 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-12-07 13:52:31,422 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_198|], 1=[|v_#memory_$Pointer$.offset_201|], 2=[|v_#memory_$Pointer$.base_182|, |v_#memory_$Pointer$.offset_182|]} [2019-12-07 13:52:31,428 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:31,593 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 13:52:31,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:31,597 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:31,701 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 13:52:31,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:31,705 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:31,773 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:31,776 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:31,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:31,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:31,791 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 13:52:34,665 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_199|], 1=[|v_#memory_$Pointer$.offset_202|]} [2019-12-07 13:52:34,668 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:34,753 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:34,755 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:34,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:34,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:34,782 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:279, output treesize:278 [2019-12-07 13:52:37,078 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_200|], 1=[|v_#memory_$Pointer$.offset_203|]} [2019-12-07 13:52:37,081 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:37,192 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 13:52:37,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:37,194 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:37,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:37,222 INFO L534 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2019-12-07 13:52:37,222 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:319, output treesize:318 [2019-12-07 13:52:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:42,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981990379] [2019-12-07 13:52:42,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:52:42,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2019-12-07 13:52:42,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85275798] [2019-12-07 13:52:42,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 13:52:42,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:52:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 13:52:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=208, Unknown=3, NotChecked=0, Total=272 [2019-12-07 13:52:42,008 INFO L87 Difference]: Start difference. First operand 1593 states and 2513 transitions. Second operand 17 states. [2019-12-07 14:01:03,333 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 14:01:59,853 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-12-07 14:02:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:35,989 INFO L93 Difference]: Finished difference Result 5380 states and 8419 transitions. [2019-12-07 14:02:35,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:02:35,990 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 164 [2019-12-07 14:02:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:36,003 INFO L225 Difference]: With dead ends: 5380 [2019-12-07 14:02:36,004 INFO L226 Difference]: Without dead ends: 3795 [2019-12-07 14:02:36,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 308 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=163, Invalid=372, Unknown=17, NotChecked=0, Total=552 [2019-12-07 14:02:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2019-12-07 14:02:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 1881. [2019-12-07 14:02:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-07 14:02:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 3026 transitions. [2019-12-07 14:02:36,078 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 3026 transitions. Word has length 164 [2019-12-07 14:02:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:36,078 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 3026 transitions. [2019-12-07 14:02:36,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:02:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 3026 transitions. [2019-12-07 14:02:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 14:02:36,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:36,082 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 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] [2019-12-07 14:02:36,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:02:36,283 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:02:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash -266471686, now seen corresponding path program 1 times [2019-12-07 14:02:36,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:02:36,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549903528] [2019-12-07 14:02:36,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:36,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:02:36,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:36,449 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_205|, |v_#memory_$Pointer$.base_202|], 4=[|v_#memory_int_217|]} [2019-12-07 14:02:36,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2019-12-07 14:02:36,451 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:36,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:36,460 INFO L377 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 85 treesize of output 49 [2019-12-07 14:02:36,460 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:02:36,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:36,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:36,500 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 14:02:36,500 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:44,607 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 14:02:44,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:44,608 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:44,608 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 14:02:44,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:02:44,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:44,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:44,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:44,619 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:02:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 14:02:44,638 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 14:02:44,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549903528] [2019-12-07 14:02:44,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:44,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:02:44,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508392364] [2019-12-07 14:02:44,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:02:44,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:02:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:02:44,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:02:44,656 INFO L87 Difference]: Start difference. First operand 1881 states and 3026 transitions. Second operand 4 states. [2019-12-07 14:02:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:47,237 INFO L93 Difference]: Finished difference Result 4015 states and 6428 transitions. [2019-12-07 14:02:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:02:47,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-12-07 14:02:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:47,247 INFO L225 Difference]: With dead ends: 4015 [2019-12-07 14:02:47,247 INFO L226 Difference]: Without dead ends: 2142 [2019-12-07 14:02:47,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:02:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-12-07 14:02:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2025. [2019-12-07 14:02:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-12-07 14:02:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 3260 transitions. [2019-12-07 14:02:47,335 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 3260 transitions. Word has length 177 [2019-12-07 14:02:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:47,336 INFO L462 AbstractCegarLoop]: Abstraction has 2025 states and 3260 transitions. [2019-12-07 14:02:47,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:02:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 3260 transitions. [2019-12-07 14:02:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 14:02:47,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:47,340 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:02:47,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:02:47,541 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:02:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:47,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2088210405, now seen corresponding path program 1 times [2019-12-07 14:02:47,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:02:47,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175622330] [2019-12-07 14:02:47,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:47,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:02:47,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:47,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 14:02:47,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:47,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:47,780 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:47,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:02:47,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:02:47,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:47,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:47,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:47,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:02:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:02:47,815 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:02:47,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175622330] [2019-12-07 14:02:47,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:47,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:02:47,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867726406] [2019-12-07 14:02:47,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:02:47,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:02:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:02:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:47,854 INFO L87 Difference]: Start difference. First operand 2025 states and 3260 transitions. Second operand 6 states. [2019-12-07 14:02:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:02:54,375 INFO L93 Difference]: Finished difference Result 6204 states and 9842 transitions. [2019-12-07 14:02:54,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:02:54,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-12-07 14:02:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:02:54,390 INFO L225 Difference]: With dead ends: 6204 [2019-12-07 14:02:54,390 INFO L226 Difference]: Without dead ends: 4187 [2019-12-07 14:02:54,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:02:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4187 states. [2019-12-07 14:02:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4187 to 2550. [2019-12-07 14:02:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2550 states. [2019-12-07 14:02:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 4207 transitions. [2019-12-07 14:02:54,469 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 4207 transitions. Word has length 177 [2019-12-07 14:02:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:02:54,470 INFO L462 AbstractCegarLoop]: Abstraction has 2550 states and 4207 transitions. [2019-12-07 14:02:54,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:02:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 4207 transitions. [2019-12-07 14:02:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 14:02:54,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:02:54,472 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-12-07 14:02:54,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:02:54,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:02:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:02:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2093282790, now seen corresponding path program 1 times [2019-12-07 14:02:54,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:02:54,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777908437] [2019-12-07 14:02:54,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 14:02:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:02:54,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:02:54,846 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:02:54,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 14:02:54,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,854 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,854 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:02:54,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:02:54,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:02:54,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:02:54,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:02:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 14:02:54,892 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:02:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 14:02:54,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777908437] [2019-12-07 14:02:54,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:02:54,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:02:54,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779988290] [2019-12-07 14:02:54,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:02:54,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:02:54,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:02:54,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:02:54,934 INFO L87 Difference]: Start difference. First operand 2550 states and 4207 transitions. Second operand 6 states. [2019-12-07 14:03:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:04,550 INFO L93 Difference]: Finished difference Result 7369 states and 11938 transitions. [2019-12-07 14:03:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:03:04,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-12-07 14:03:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:04,567 INFO L225 Difference]: With dead ends: 7369 [2019-12-07 14:03:04,567 INFO L226 Difference]: Without dead ends: 4827 [2019-12-07 14:03:04,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:03:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2019-12-07 14:03:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 2944. [2019-12-07 14:03:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-07 14:03:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4937 transitions. [2019-12-07 14:03:04,658 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4937 transitions. Word has length 178 [2019-12-07 14:03:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:04,659 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 4937 transitions. [2019-12-07 14:03:04,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:03:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4937 transitions. [2019-12-07 14:03:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 14:03:04,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:04,662 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:04,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:03:04,862 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:03:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1359941925, now seen corresponding path program 1 times [2019-12-07 14:03:04,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:03:04,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768479427] [2019-12-07 14:03:04,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:05,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:03:05,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:05,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 14:03:05,088 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,090 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:03:05,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:03:05,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:05,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:05,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:03:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:03:05,123 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 14:03:05,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768479427] [2019-12-07 14:03:05,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:03:05,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:03:05,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021908945] [2019-12-07 14:03:05,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:03:05,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:03:05,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:03:05,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:03:05,163 INFO L87 Difference]: Start difference. First operand 2944 states and 4937 transitions. Second operand 6 states. [2019-12-07 14:03:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:12,033 INFO L93 Difference]: Finished difference Result 7480 states and 12179 transitions. [2019-12-07 14:03:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:03:12,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-12-07 14:03:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:12,047 INFO L225 Difference]: With dead ends: 7480 [2019-12-07 14:03:12,048 INFO L226 Difference]: Without dead ends: 4544 [2019-12-07 14:03:12,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:03:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-12-07 14:03:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 2951. [2019-12-07 14:03:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-12-07 14:03:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4935 transitions. [2019-12-07 14:03:12,141 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4935 transitions. Word has length 178 [2019-12-07 14:03:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:12,141 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 4935 transitions. [2019-12-07 14:03:12,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:03:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4935 transitions. [2019-12-07 14:03:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 14:03:12,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:12,144 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-12-07 14:03:12,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:03:12,345 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:03:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:12,346 INFO L82 PathProgramCache]: Analyzing trace with hash -474621622, now seen corresponding path program 1 times [2019-12-07 14:03:12,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:03:12,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403233123] [2019-12-07 14:03:12,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:12,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:03:12,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:03:12,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-12-07 14:03:12,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:12,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:12,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:12,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:03:12,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:03:12,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:03:12,548 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:03:12,548 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:03:12,548 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:03:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 14:03:12,574 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:03:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 14:03:12,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403233123] [2019-12-07 14:03:12,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:03:12,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:03:12,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811806587] [2019-12-07 14:03:12,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:03:12,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:03:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:03:12,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:03:12,615 INFO L87 Difference]: Start difference. First operand 2951 states and 4935 transitions. Second operand 6 states. [2019-12-07 14:03:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:21,559 INFO L93 Difference]: Finished difference Result 7445 states and 12100 transitions. [2019-12-07 14:03:21,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:03:21,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-12-07 14:03:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:21,567 INFO L225 Difference]: With dead ends: 7445 [2019-12-07 14:03:21,567 INFO L226 Difference]: Without dead ends: 4502 [2019-12-07 14:03:21,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:03:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2019-12-07 14:03:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 2967. [2019-12-07 14:03:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2967 states. [2019-12-07 14:03:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 4958 transitions. [2019-12-07 14:03:21,656 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 4958 transitions. Word has length 179 [2019-12-07 14:03:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:03:21,657 INFO L462 AbstractCegarLoop]: Abstraction has 2967 states and 4958 transitions. [2019-12-07 14:03:21,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:03:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 4958 transitions. [2019-12-07 14:03:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 14:03:21,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:21,660 INFO L410 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] [2019-12-07 14:03:21,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:03:21,860 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:03:21,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:21,861 INFO L82 PathProgramCache]: Analyzing trace with hash 990290520, now seen corresponding path program 1 times [2019-12-07 14:03:21,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:03:21,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992431276] [2019-12-07 14:03:21,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 14:03:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:03:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:03:22,759 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 14:03:22,759 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:03:22,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:03:23,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:03:23 BoogieIcfgContainer [2019-12-07 14:03:23,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:03:23,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:03:23,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:03:23,158 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:03:23,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:43" (3/4) ... [2019-12-07 14:03:23,160 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:03:23,243 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eb55f8d0-5132-4753-914e-67f1dddd3b3b/bin/uautomizer/witness.graphml [2019-12-07 14:03:23,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:03:23,244 INFO L168 Benchmark]: Toolchain (without parser) took 702094.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 946.9 MB in the beginning and 789.5 MB in the end (delta: 157.4 MB). Peak memory consumption was 378.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:03:23,244 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:03:23,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 420.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:03:23,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:03:23,245 INFO L168 Benchmark]: Boogie Preprocessor took 53.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:03:23,245 INFO L168 Benchmark]: RCFGBuilder took 1936.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:03:23,245 INFO L168 Benchmark]: TraceAbstraction took 699536.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 988.2 MB in the beginning and 814.5 MB in the end (delta: 173.7 MB). Peak memory consumption was 268.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:03:23,245 INFO L168 Benchmark]: Witness Printer took 85.27 ms. Allocated memory is still 1.3 GB. Free memory was 814.5 MB in the beginning and 789.5 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:03:23,247 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 420.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1936.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 699536.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 988.2 MB in the beginning and 814.5 MB in the end (delta: 173.7 MB). Peak memory consumption was 268.1 MB. Max. memory is 11.5 GB. * Witness Printer took 85.27 ms. Allocated memory is still 1.3 GB. Free memory was 814.5 MB in the beginning and 789.5 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1727]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={15: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)) [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 [init=1, SSLv3_server_data={15:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={15:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={15:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={15:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={15:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={15:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND TRUE s->state == 8656 [L1579] EXPR s->session [L1579] EXPR s->s3 [L1579] EXPR (s->s3)->tmp.new_cipher [L1579] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [init=1, SSLv3_server_data={15:0}] [L1592] COND FALSE !(ret <= 0) [L1597] s->state = 8672 [L1598] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1599] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={15:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [init=1, SSLv3_server_data={15:0}] [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={15:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={15:0}] [L1727] __VERIFIER_error() VAL [init=1, SSLv3_server_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 699.2s, OverallIterations: 13, TraceHistogramMax: 7, AutomataDifference: 656.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3062 SDtfs, 3771 SDslu, 5644 SDs, 0 SdLazy, 5058 SolverSat, 716 SolverUnsat, 264 SolverUnknown, 0 SolverNotchecked, 609.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3453 GetRequests, 3381 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 49.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2967occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 10773 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 36.0s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3434 ConstructedInterpolants, 197 QuantifiedInterpolants, 4909320 SizeOfPredicates, 46 NumberOfNonLiveVariables, 4138 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 4467/4798 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...