./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.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_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 221d8ee995a69c986b355f515c858471b19e54a2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 221d8ee995a69c986b355f515c858471b19e54a2 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:29:53,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:29:53,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:29:53,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:29:53,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:29:53,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:29:53,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:29:53,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:29:53,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:29:53,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:29:53,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:29:53,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:29:53,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:29:53,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:29:53,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:29:54,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:29:54,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:29:54,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:29:54,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:29:54,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:29:54,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:29:54,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:29:54,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:29:54,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:29:54,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:29:54,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:29:54,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:29:54,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:29:54,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:29:54,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:29:54,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:29:54,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:29:54,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:29:54,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:29:54,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:29:54,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:29:54,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:29:54,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:29:54,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:29:54,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:29:54,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:29:54,019 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:29:54,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:29:54,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:29:54,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:29:54,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:29:54,031 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:29:54,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:29:54,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:29:54,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:29:54,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:29:54,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:29:54,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:29:54,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:29:54,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:29:54,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:29:54,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:29:54,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:29:54,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:29:54,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:29:54,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:29:54,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:29:54,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:29:54,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:29:54,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:29:54,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:29:54,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:29:54,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:29:54,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:29:54,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:29:54,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:29:54,035 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_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-12-07 11:29:54,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:29:54,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:29:54,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:29:54,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:29:54,150 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:29:54,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-12-07 11:29:54,187 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/31cc5f9f0/e46b0ae8ba2b40b18f1c800127eed1d7/FLAG0fbffbe98 [2019-12-07 11:29:54,592 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:29:54,592 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-12-07 11:29:54,604 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/31cc5f9f0/e46b0ae8ba2b40b18f1c800127eed1d7/FLAG0fbffbe98 [2019-12-07 11:29:54,613 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/31cc5f9f0/e46b0ae8ba2b40b18f1c800127eed1d7 [2019-12-07 11:29:54,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:29:54,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:29:54,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:54,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:29:54,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:29:54,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:54" (1/1) ... [2019-12-07 11:29:54,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a30f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:54, skipping insertion in model container [2019-12-07 11:29:54,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:54" (1/1) ... [2019-12-07 11:29:54,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:29:54,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:29:54,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:54,969 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:29:55,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:55,070 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:29:55,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55 WrapperNode [2019-12-07 11:29:55,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:55,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:55,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:29:55,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:29:55,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:55,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:29:55,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:29:55,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:29:55,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... [2019-12-07 11:29:55,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:29:55,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:29:55,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:29:55,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:29:55,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:29:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:29:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:29:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:29:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:29:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:29:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:29:55,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:29:55,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:29:55,389 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:29:55,897 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 11:29:55,897 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 11:29:55,898 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:29:55,898 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:29:55,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:55 BoogieIcfgContainer [2019-12-07 11:29:55,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:29:55,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:29:55,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:29:55,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:29:55,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:29:54" (1/3) ... [2019-12-07 11:29:55,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467a16a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:55, skipping insertion in model container [2019-12-07 11:29:55,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:55" (2/3) ... [2019-12-07 11:29:55,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467a16a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:55, skipping insertion in model container [2019-12-07 11:29:55,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:55" (3/3) ... [2019-12-07 11:29:55,904 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-12-07 11:29:55,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:29:55,915 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:29:55,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:29:55,939 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:29:55,939 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:29:55,939 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:29:55,939 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:29:55,940 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:29:55,940 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:29:55,940 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:29:55,940 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:29:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-12-07 11:29:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:29:55,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:55,959 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:55,960 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2019-12-07 11:29:55,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:55,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105154148] [2019-12-07 11:29:55,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:56,168 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 11:29:56,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105154148] [2019-12-07 11:29:56,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:56,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:56,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113675533] [2019-12-07 11:29:56,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:56,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:56,183 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-12-07 11:29:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:56,526 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2019-12-07 11:29:56,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:56,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 11:29:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:56,537 INFO L225 Difference]: With dead ends: 329 [2019-12-07 11:29:56,537 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 11:29:56,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 11:29:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 11:29:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-12-07 11:29:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2019-12-07 11:29:56,573 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 43 [2019-12-07 11:29:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:56,573 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2019-12-07 11:29:56,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2019-12-07 11:29:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:29:56,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:56,576 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:56,576 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1905377872, now seen corresponding path program 1 times [2019-12-07 11:29:56,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:56,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898311587] [2019-12-07 11:29:56,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:56,655 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 11:29:56,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898311587] [2019-12-07 11:29:56,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:56,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:56,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686149422] [2019-12-07 11:29:56,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:56,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:56,658 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand 4 states. [2019-12-07 11:29:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:56,896 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-12-07 11:29:56,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:56,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 11:29:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:56,899 INFO L225 Difference]: With dead ends: 296 [2019-12-07 11:29:56,899 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 11:29:56,900 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 11:29:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 11:29:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-12-07 11:29:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2019-12-07 11:29:56,908 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 56 [2019-12-07 11:29:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:56,909 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2019-12-07 11:29:56,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2019-12-07 11:29:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:29:56,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:56,911 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:56,911 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1255882526, now seen corresponding path program 1 times [2019-12-07 11:29:56,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:56,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099938863] [2019-12-07 11:29:56,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:56,994 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 11:29:56,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099938863] [2019-12-07 11:29:56,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:56,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:56,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177006513] [2019-12-07 11:29:56,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:56,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:56,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:56,996 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand 4 states. [2019-12-07 11:29:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:57,218 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2019-12-07 11:29:57,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:57,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 11:29:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:57,221 INFO L225 Difference]: With dead ends: 295 [2019-12-07 11:29:57,221 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 11:29:57,222 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 11:29:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 11:29:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-12-07 11:29:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-12-07 11:29:57,231 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 57 [2019-12-07 11:29:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:57,231 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-12-07 11:29:57,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-12-07 11:29:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:29:57,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:57,233 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:57,233 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2070651149, now seen corresponding path program 1 times [2019-12-07 11:29:57,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:57,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139097547] [2019-12-07 11:29:57,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:57,287 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 11:29:57,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139097547] [2019-12-07 11:29:57,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:57,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:57,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440030744] [2019-12-07 11:29:57,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:57,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:57,288 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 4 states. [2019-12-07 11:29:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:57,489 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2019-12-07 11:29:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:57,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 11:29:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:57,490 INFO L225 Difference]: With dead ends: 293 [2019-12-07 11:29:57,490 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 11:29:57,491 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 11:29:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 11:29:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-12-07 11:29:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2019-12-07 11:29:57,496 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 57 [2019-12-07 11:29:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:57,496 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2019-12-07 11:29:57,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2019-12-07 11:29:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:29:57,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:57,497 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:57,497 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash -221095859, now seen corresponding path program 1 times [2019-12-07 11:29:57,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:57,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754561380] [2019-12-07 11:29:57,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:57,539 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 11:29:57,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754561380] [2019-12-07 11:29:57,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:57,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:57,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066326528] [2019-12-07 11:29:57,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:57,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:57,541 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand 4 states. [2019-12-07 11:29:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:57,728 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2019-12-07 11:29:57,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:57,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 11:29:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:57,729 INFO L225 Difference]: With dead ends: 292 [2019-12-07 11:29:57,729 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 11:29:57,730 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 11:29:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 11:29:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 11:29:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2019-12-07 11:29:57,735 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 57 [2019-12-07 11:29:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:57,735 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2019-12-07 11:29:57,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2019-12-07 11:29:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:29:57,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:57,736 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:57,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash 631020918, now seen corresponding path program 1 times [2019-12-07 11:29:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:57,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451021635] [2019-12-07 11:29:57,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:57,783 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 11:29:57,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451021635] [2019-12-07 11:29:57,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:57,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:57,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030782570] [2019-12-07 11:29:57,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:57,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:57,784 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand 4 states. [2019-12-07 11:29:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:57,962 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-12-07 11:29:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:57,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 11:29:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:57,963 INFO L225 Difference]: With dead ends: 292 [2019-12-07 11:29:57,963 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 11:29:57,964 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 11:29:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 11:29:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 11:29:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2019-12-07 11:29:57,967 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 57 [2019-12-07 11:29:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:57,967 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2019-12-07 11:29:57,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2019-12-07 11:29:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:29:57,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:57,968 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:57,968 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1772080409, now seen corresponding path program 1 times [2019-12-07 11:29:57,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:57,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766524018] [2019-12-07 11:29:57,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:58,002 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 11:29:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766524018] [2019-12-07 11:29:58,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:58,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:58,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125434798] [2019-12-07 11:29:58,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:58,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:58,003 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand 4 states. [2019-12-07 11:29:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:58,192 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-12-07 11:29:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:58,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:29:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:58,194 INFO L225 Difference]: With dead ends: 292 [2019-12-07 11:29:58,194 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 11:29:58,194 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 11:29:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 11:29:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 11:29:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-12-07 11:29:58,198 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 58 [2019-12-07 11:29:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:58,198 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-12-07 11:29:58,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-12-07 11:29:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:29:58,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:58,199 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:58,199 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:58,199 INFO L82 PathProgramCache]: Analyzing trace with hash -245018341, now seen corresponding path program 1 times [2019-12-07 11:29:58,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:58,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081506150] [2019-12-07 11:29:58,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:58,233 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 11:29:58,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081506150] [2019-12-07 11:29:58,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:58,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:58,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884655112] [2019-12-07 11:29:58,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:58,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:58,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:58,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:58,234 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-12-07 11:29:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:58,421 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2019-12-07 11:29:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:58,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 11:29:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:58,423 INFO L225 Difference]: With dead ends: 292 [2019-12-07 11:29:58,423 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 11:29:58,423 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 11:29:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 11:29:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 11:29:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-12-07 11:29:58,426 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 59 [2019-12-07 11:29:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:58,427 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-12-07 11:29:58,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-12-07 11:29:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:29:58,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:58,427 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:58,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1380774754, now seen corresponding path program 1 times [2019-12-07 11:29:58,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:58,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155076806] [2019-12-07 11:29:58,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:58,461 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 11:29:58,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155076806] [2019-12-07 11:29:58,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:58,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:58,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539528876] [2019-12-07 11:29:58,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:58,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:58,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:58,463 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-12-07 11:29:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:58,638 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2019-12-07 11:29:58,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:58,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 11:29:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:58,639 INFO L225 Difference]: With dead ends: 282 [2019-12-07 11:29:58,639 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 11:29:58,640 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 11:29:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 11:29:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-12-07 11:29:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:29:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-12-07 11:29:58,643 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 60 [2019-12-07 11:29:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:58,643 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-12-07 11:29:58,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-12-07 11:29:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:29:58,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:58,644 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, 1, 1] [2019-12-07 11:29:58,644 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1992648186, now seen corresponding path program 1 times [2019-12-07 11:29:58,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:58,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647687507] [2019-12-07 11:29:58,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:58,676 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 11:29:58,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647687507] [2019-12-07 11:29:58,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:58,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:58,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513824977] [2019-12-07 11:29:58,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:58,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:58,678 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 4 states. [2019-12-07 11:29:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:58,902 INFO L93 Difference]: Finished difference Result 322 states and 492 transitions. [2019-12-07 11:29:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:58,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 11:29:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:58,903 INFO L225 Difference]: With dead ends: 322 [2019-12-07 11:29:58,904 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 11:29:58,904 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 11:29:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 11:29:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-12-07 11:29:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:29:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2019-12-07 11:29:58,908 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 60 [2019-12-07 11:29:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:58,908 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2019-12-07 11:29:58,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2019-12-07 11:29:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 11:29:58,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:58,909 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:58,909 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1514156125, now seen corresponding path program 1 times [2019-12-07 11:29:58,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:58,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720137317] [2019-12-07 11:29:58,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:58,942 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 11:29:58,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720137317] [2019-12-07 11:29:58,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:58,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:58,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178792894] [2019-12-07 11:29:58,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:58,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:58,944 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand 4 states. [2019-12-07 11:29:59,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:59,176 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2019-12-07 11:29:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:59,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 11:29:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:59,177 INFO L225 Difference]: With dead ends: 344 [2019-12-07 11:29:59,177 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 11:29:59,177 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 11:29:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 11:29:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-12-07 11:29:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:29:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2019-12-07 11:29:59,182 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 73 [2019-12-07 11:29:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:59,182 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2019-12-07 11:29:59,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2019-12-07 11:29:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 11:29:59,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:59,184 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:59,184 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 112745967, now seen corresponding path program 1 times [2019-12-07 11:29:59,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:59,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200029092] [2019-12-07 11:29:59,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:59,222 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 11:29:59,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200029092] [2019-12-07 11:29:59,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:59,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:59,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077554513] [2019-12-07 11:29:59,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:59,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:59,223 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand 4 states. [2019-12-07 11:29:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:59,451 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-12-07 11:29:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:59,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 11:29:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:59,453 INFO L225 Difference]: With dead ends: 343 [2019-12-07 11:29:59,453 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 11:29:59,453 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 11:29:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 11:29:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2019-12-07 11:29:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:29:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2019-12-07 11:29:59,457 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 74 [2019-12-07 11:29:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:59,457 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2019-12-07 11:29:59,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2019-12-07 11:29:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 11:29:59,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:59,458 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:59,458 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash -855687654, now seen corresponding path program 1 times [2019-12-07 11:29:59,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:59,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747232568] [2019-12-07 11:29:59,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:59,488 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 11:29:59,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747232568] [2019-12-07 11:29:59,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:59,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:59,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419228595] [2019-12-07 11:29:59,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:59,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:59,489 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand 4 states. [2019-12-07 11:29:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:59,728 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2019-12-07 11:29:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:59,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 11:29:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:59,729 INFO L225 Difference]: With dead ends: 341 [2019-12-07 11:29:59,729 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 11:29:59,730 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 11:29:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 11:29:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2019-12-07 11:29:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:29:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2019-12-07 11:29:59,734 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 74 [2019-12-07 11:29:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:59,734 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2019-12-07 11:29:59,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2019-12-07 11:29:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 11:29:59,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:59,735 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:59,736 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1147532634, now seen corresponding path program 1 times [2019-12-07 11:29:59,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:59,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7975058] [2019-12-07 11:29:59,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:59,773 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 11:29:59,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7975058] [2019-12-07 11:29:59,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:59,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:29:59,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461544620] [2019-12-07 11:29:59,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:29:59,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:29:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:29:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:29:59,775 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand 4 states. [2019-12-07 11:29:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:59,986 INFO L93 Difference]: Finished difference Result 340 states and 519 transitions. [2019-12-07 11:29:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:29:59,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 11:29:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:59,987 INFO L225 Difference]: With dead ends: 340 [2019-12-07 11:29:59,987 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 11:29:59,988 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 11:29:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 11:29:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 11:29:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:29:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2019-12-07 11:29:59,991 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 74 [2019-12-07 11:29:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:59,991 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2019-12-07 11:29:59,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:29:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2019-12-07 11:29:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 11:29:59,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:59,992 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:59,992 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1999649411, now seen corresponding path program 1 times [2019-12-07 11:29:59,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:29:59,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314399334] [2019-12-07 11:29:59,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:00,018 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 11:30:00,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314399334] [2019-12-07 11:30:00,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:00,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:00,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452304603] [2019-12-07 11:30:00,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:00,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:00,020 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand 4 states. [2019-12-07 11:30:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:00,251 INFO L93 Difference]: Finished difference Result 340 states and 517 transitions. [2019-12-07 11:30:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:00,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 11:30:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:00,252 INFO L225 Difference]: With dead ends: 340 [2019-12-07 11:30:00,252 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 11:30:00,252 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 11:30:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 11:30:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 11:30:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:30:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2019-12-07 11:30:00,256 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 74 [2019-12-07 11:30:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:00,256 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2019-12-07 11:30:00,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2019-12-07 11:30:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:30:00,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:00,257 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:00,257 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:00,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:00,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1249890732, now seen corresponding path program 1 times [2019-12-07 11:30:00,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:00,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502416099] [2019-12-07 11:30:00,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:00,282 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 11:30:00,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502416099] [2019-12-07 11:30:00,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:00,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:00,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259847682] [2019-12-07 11:30:00,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:00,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:00,283 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand 4 states. [2019-12-07 11:30:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:00,536 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2019-12-07 11:30:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:00,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 11:30:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:00,537 INFO L225 Difference]: With dead ends: 340 [2019-12-07 11:30:00,537 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 11:30:00,538 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 11:30:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 11:30:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 11:30:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:30:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2019-12-07 11:30:00,541 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 75 [2019-12-07 11:30:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:00,541 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2019-12-07 11:30:00,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2019-12-07 11:30:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 11:30:00,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:00,542 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:00,542 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:00,542 INFO L82 PathProgramCache]: Analyzing trace with hash 746970856, now seen corresponding path program 1 times [2019-12-07 11:30:00,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:00,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385115047] [2019-12-07 11:30:00,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:00,568 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 11:30:00,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385115047] [2019-12-07 11:30:00,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:00,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:00,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658399375] [2019-12-07 11:30:00,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:00,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:00,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:00,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:00,570 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand 4 states. [2019-12-07 11:30:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:00,788 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2019-12-07 11:30:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:00,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 11:30:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:00,789 INFO L225 Difference]: With dead ends: 340 [2019-12-07 11:30:00,789 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 11:30:00,790 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 11:30:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 11:30:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 11:30:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:30:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2019-12-07 11:30:00,793 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 76 [2019-12-07 11:30:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:00,794 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2019-12-07 11:30:00,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2019-12-07 11:30:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 11:30:00,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:00,795 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:00,795 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:00,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -693880719, now seen corresponding path program 1 times [2019-12-07 11:30:00,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:00,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682557493] [2019-12-07 11:30:00,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:00,833 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 11:30:00,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682557493] [2019-12-07 11:30:00,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:00,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:00,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240781694] [2019-12-07 11:30:00,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:00,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:00,834 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand 4 states. [2019-12-07 11:30:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:01,041 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-12-07 11:30:01,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:01,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 11:30:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:01,042 INFO L225 Difference]: With dead ends: 330 [2019-12-07 11:30:01,042 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 11:30:01,043 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 11:30:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 11:30:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2019-12-07 11:30:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 11:30:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2019-12-07 11:30:01,045 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 77 [2019-12-07 11:30:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:01,046 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2019-12-07 11:30:01,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2019-12-07 11:30:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 11:30:01,046 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:01,046 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, 1] [2019-12-07 11:30:01,046 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:01,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash -242622967, now seen corresponding path program 1 times [2019-12-07 11:30:01,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:01,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630610080] [2019-12-07 11:30:01,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:01,087 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 11:30:01,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630610080] [2019-12-07 11:30:01,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:01,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:01,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758410638] [2019-12-07 11:30:01,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:01,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:01,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:01,088 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand 4 states. [2019-12-07 11:30:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:01,364 INFO L93 Difference]: Finished difference Result 432 states and 655 transitions. [2019-12-07 11:30:01,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:01,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 11:30:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:01,365 INFO L225 Difference]: With dead ends: 432 [2019-12-07 11:30:01,365 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 11:30:01,366 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 11:30:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 11:30:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 212. [2019-12-07 11:30:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 11:30:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2019-12-07 11:30:01,369 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 82 [2019-12-07 11:30:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:01,369 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2019-12-07 11:30:01,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2019-12-07 11:30:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 11:30:01,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:01,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, 1] [2019-12-07 11:30:01,370 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash 181023755, now seen corresponding path program 1 times [2019-12-07 11:30:01,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:01,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915147485] [2019-12-07 11:30:01,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:01,404 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 11:30:01,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915147485] [2019-12-07 11:30:01,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:01,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:01,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574358640] [2019-12-07 11:30:01,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:01,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:01,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:01,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:01,405 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand 4 states. [2019-12-07 11:30:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:01,652 INFO L93 Difference]: Finished difference Result 454 states and 709 transitions. [2019-12-07 11:30:01,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:01,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 11:30:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:01,654 INFO L225 Difference]: With dead ends: 454 [2019-12-07 11:30:01,654 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 11:30:01,654 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 11:30:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 11:30:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 236. [2019-12-07 11:30:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 11:30:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2019-12-07 11:30:01,658 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 82 [2019-12-07 11:30:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:01,658 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2019-12-07 11:30:01,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2019-12-07 11:30:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 11:30:01,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:01,658 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, 1, 1] [2019-12-07 11:30:01,659 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash -910969721, now seen corresponding path program 1 times [2019-12-07 11:30:01,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:01,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595993879] [2019-12-07 11:30:01,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:01,699 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 11:30:01,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595993879] [2019-12-07 11:30:01,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:01,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:01,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772317604] [2019-12-07 11:30:01,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:01,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:01,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:01,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:01,700 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand 4 states. [2019-12-07 11:30:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:01,980 INFO L93 Difference]: Finished difference Result 513 states and 801 transitions. [2019-12-07 11:30:01,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:01,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 11:30:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:01,981 INFO L225 Difference]: With dead ends: 513 [2019-12-07 11:30:01,981 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 11:30:01,982 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 11:30:01,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 11:30:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2019-12-07 11:30:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:30:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 371 transitions. [2019-12-07 11:30:01,986 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 371 transitions. Word has length 83 [2019-12-07 11:30:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:01,986 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 371 transitions. [2019-12-07 11:30:01,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2019-12-07 11:30:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 11:30:01,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:01,987 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:01,987 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:01,987 INFO L82 PathProgramCache]: Analyzing trace with hash 83388544, now seen corresponding path program 1 times [2019-12-07 11:30:01,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:01,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562198583] [2019-12-07 11:30:01,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:02,021 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 11:30:02,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562198583] [2019-12-07 11:30:02,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:02,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:02,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688330593] [2019-12-07 11:30:02,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:02,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:02,023 INFO L87 Difference]: Start difference. First operand 237 states and 371 transitions. Second operand 4 states. [2019-12-07 11:30:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:02,316 INFO L93 Difference]: Finished difference Result 514 states and 801 transitions. [2019-12-07 11:30:02,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:02,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 11:30:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:02,317 INFO L225 Difference]: With dead ends: 514 [2019-12-07 11:30:02,318 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 11:30:02,318 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 11:30:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 11:30:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2019-12-07 11:30:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:30:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2019-12-07 11:30:02,321 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 95 [2019-12-07 11:30:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:02,322 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2019-12-07 11:30:02,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2019-12-07 11:30:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 11:30:02,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:02,322 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:02,322 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 959407550, now seen corresponding path program 1 times [2019-12-07 11:30:02,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:02,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529922982] [2019-12-07 11:30:02,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:02,364 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 11:30:02,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529922982] [2019-12-07 11:30:02,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:02,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:02,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166600382] [2019-12-07 11:30:02,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:02,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:02,366 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand 4 states. [2019-12-07 11:30:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:02,619 INFO L93 Difference]: Finished difference Result 480 states and 750 transitions. [2019-12-07 11:30:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:02,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 11:30:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:02,621 INFO L225 Difference]: With dead ends: 480 [2019-12-07 11:30:02,621 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 11:30:02,621 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 11:30:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 11:30:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2019-12-07 11:30:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:30:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2019-12-07 11:30:02,625 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 95 [2019-12-07 11:30:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:02,625 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2019-12-07 11:30:02,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2019-12-07 11:30:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:30:02,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:02,626 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:02,626 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:02,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1902976846, now seen corresponding path program 1 times [2019-12-07 11:30:02,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:02,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221203550] [2019-12-07 11:30:02,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:02,658 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 11:30:02,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221203550] [2019-12-07 11:30:02,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:02,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:02,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206628666] [2019-12-07 11:30:02,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:02,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:02,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:02,659 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand 4 states. [2019-12-07 11:30:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:03,011 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-12-07 11:30:03,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:03,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 11:30:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:03,015 INFO L225 Difference]: With dead ends: 513 [2019-12-07 11:30:03,015 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 11:30:03,016 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 11:30:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 11:30:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2019-12-07 11:30:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:30:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2019-12-07 11:30:03,025 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 96 [2019-12-07 11:30:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:03,025 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2019-12-07 11:30:03,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2019-12-07 11:30:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:30:03,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:03,027 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:03,027 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1423556829, now seen corresponding path program 1 times [2019-12-07 11:30:03,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:03,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965480120] [2019-12-07 11:30:03,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:03,070 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 11:30:03,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965480120] [2019-12-07 11:30:03,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:03,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:03,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397195044] [2019-12-07 11:30:03,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:03,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:03,072 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand 4 states. [2019-12-07 11:30:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:03,390 INFO L93 Difference]: Finished difference Result 511 states and 792 transitions. [2019-12-07 11:30:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:03,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 11:30:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:03,391 INFO L225 Difference]: With dead ends: 511 [2019-12-07 11:30:03,391 INFO L226 Difference]: Without dead ends: 293 [2019-12-07 11:30:03,392 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 11:30:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-07 11:30:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2019-12-07 11:30:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:30:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 367 transitions. [2019-12-07 11:30:03,395 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 367 transitions. Word has length 96 [2019-12-07 11:30:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:03,395 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 367 transitions. [2019-12-07 11:30:03,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2019-12-07 11:30:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:30:03,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:03,397 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:03,397 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash -868190179, now seen corresponding path program 1 times [2019-12-07 11:30:03,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:03,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125540628] [2019-12-07 11:30:03,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:03,437 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 11:30:03,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125540628] [2019-12-07 11:30:03,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:03,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:03,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432752870] [2019-12-07 11:30:03,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:03,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:03,438 INFO L87 Difference]: Start difference. First operand 237 states and 367 transitions. Second operand 4 states. [2019-12-07 11:30:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:03,725 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2019-12-07 11:30:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:03,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 11:30:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:03,727 INFO L225 Difference]: With dead ends: 510 [2019-12-07 11:30:03,727 INFO L226 Difference]: Without dead ends: 292 [2019-12-07 11:30:03,728 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 11:30:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-07 11:30:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 237. [2019-12-07 11:30:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 11:30:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2019-12-07 11:30:03,731 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 96 [2019-12-07 11:30:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:03,731 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2019-12-07 11:30:03,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2019-12-07 11:30:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:30:03,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:03,732 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:03,732 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:03,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:03,732 INFO L82 PathProgramCache]: Analyzing trace with hash -16073402, now seen corresponding path program 1 times [2019-12-07 11:30:03,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:03,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386399459] [2019-12-07 11:30:03,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:03,773 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 11:30:03,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386399459] [2019-12-07 11:30:03,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:03,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:30:03,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105487931] [2019-12-07 11:30:03,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:03,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:03,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:03,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:03,774 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand 5 states. [2019-12-07 11:30:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:04,076 INFO L93 Difference]: Finished difference Result 476 states and 740 transitions. [2019-12-07 11:30:04,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:30:04,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-07 11:30:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:04,078 INFO L225 Difference]: With dead ends: 476 [2019-12-07 11:30:04,078 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 11:30:04,078 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 11:30:04,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 11:30:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-12-07 11:30:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2019-12-07 11:30:04,082 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 96 [2019-12-07 11:30:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:04,082 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2019-12-07 11:30:04,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2019-12-07 11:30:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:30:04,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:04,083 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:04,083 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1484625057, now seen corresponding path program 1 times [2019-12-07 11:30:04,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:04,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158129235] [2019-12-07 11:30:04,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:04,116 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 11:30:04,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158129235] [2019-12-07 11:30:04,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:04,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:04,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006014293] [2019-12-07 11:30:04,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:04,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:04,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:04,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:04,117 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand 4 states. [2019-12-07 11:30:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:04,327 INFO L93 Difference]: Finished difference Result 517 states and 790 transitions. [2019-12-07 11:30:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:04,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 11:30:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:04,329 INFO L225 Difference]: With dead ends: 517 [2019-12-07 11:30:04,329 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 11:30:04,330 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 11:30:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 11:30:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-12-07 11:30:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-12-07 11:30:04,335 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 96 [2019-12-07 11:30:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:04,336 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-12-07 11:30:04,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-12-07 11:30:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 11:30:04,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:04,337 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:04,337 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 518595231, now seen corresponding path program 1 times [2019-12-07 11:30:04,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:04,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132907327] [2019-12-07 11:30:04,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:04,379 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 11:30:04,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132907327] [2019-12-07 11:30:04,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:04,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:04,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462567787] [2019-12-07 11:30:04,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:04,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:04,380 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-12-07 11:30:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:04,610 INFO L93 Difference]: Finished difference Result 516 states and 787 transitions. [2019-12-07 11:30:04,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:04,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 11:30:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:04,612 INFO L225 Difference]: With dead ends: 516 [2019-12-07 11:30:04,612 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 11:30:04,612 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 11:30:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 11:30:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-12-07 11:30:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-12-07 11:30:04,617 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 96 [2019-12-07 11:30:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:04,617 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-12-07 11:30:04,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-12-07 11:30:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:30:04,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:04,618 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:04,618 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash -445614852, now seen corresponding path program 1 times [2019-12-07 11:30:04,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:04,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618040741] [2019-12-07 11:30:04,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:04,648 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 11:30:04,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618040741] [2019-12-07 11:30:04,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:04,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:04,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431327312] [2019-12-07 11:30:04,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:04,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:04,649 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-12-07 11:30:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:04,955 INFO L93 Difference]: Finished difference Result 550 states and 834 transitions. [2019-12-07 11:30:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:04,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:30:04,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:04,957 INFO L225 Difference]: With dead ends: 550 [2019-12-07 11:30:04,957 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 11:30:04,958 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 11:30:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 11:30:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-12-07 11:30:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-12-07 11:30:04,963 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 97 [2019-12-07 11:30:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:04,963 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-12-07 11:30:04,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-12-07 11:30:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 11:30:04,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:04,964 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:04,964 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash -404940102, now seen corresponding path program 1 times [2019-12-07 11:30:04,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:04,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761988779] [2019-12-07 11:30:04,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:05,002 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 11:30:05,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761988779] [2019-12-07 11:30:05,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:05,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:05,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976840493] [2019-12-07 11:30:05,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:05,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:05,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:05,003 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-12-07 11:30:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:05,232 INFO L93 Difference]: Finished difference Result 516 states and 783 transitions. [2019-12-07 11:30:05,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:05,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 11:30:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:05,234 INFO L225 Difference]: With dead ends: 516 [2019-12-07 11:30:05,234 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 11:30:05,234 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 11:30:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 11:30:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-12-07 11:30:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-12-07 11:30:05,238 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 97 [2019-12-07 11:30:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:05,239 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-12-07 11:30:05,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-12-07 11:30:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:30:05,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:05,239 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:05,239 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash 65194841, now seen corresponding path program 1 times [2019-12-07 11:30:05,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:05,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315400101] [2019-12-07 11:30:05,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:05,275 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 11:30:05,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315400101] [2019-12-07 11:30:05,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:05,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:05,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105493246] [2019-12-07 11:30:05,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:05,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:05,276 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-12-07 11:30:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:05,554 INFO L93 Difference]: Finished difference Result 550 states and 830 transitions. [2019-12-07 11:30:05,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:05,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:30:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:05,556 INFO L225 Difference]: With dead ends: 550 [2019-12-07 11:30:05,556 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 11:30:05,556 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 11:30:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 11:30:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-12-07 11:30:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-12-07 11:30:05,562 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 98 [2019-12-07 11:30:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:05,562 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-12-07 11:30:05,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-12-07 11:30:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 11:30:05,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:05,563 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:05,563 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:05,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1326112091, now seen corresponding path program 1 times [2019-12-07 11:30:05,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:05,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25693881] [2019-12-07 11:30:05,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:05,596 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 11:30:05,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25693881] [2019-12-07 11:30:05,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:05,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:05,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940592821] [2019-12-07 11:30:05,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:05,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:05,598 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-12-07 11:30:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:05,804 INFO L93 Difference]: Finished difference Result 516 states and 779 transitions. [2019-12-07 11:30:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:05,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 11:30:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:05,806 INFO L225 Difference]: With dead ends: 516 [2019-12-07 11:30:05,806 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 11:30:05,806 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 11:30:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 11:30:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-12-07 11:30:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-12-07 11:30:05,812 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 98 [2019-12-07 11:30:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:05,812 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-12-07 11:30:05,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-12-07 11:30:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:30:05,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:05,813 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:05,814 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:05,814 INFO L82 PathProgramCache]: Analyzing trace with hash -726636041, now seen corresponding path program 1 times [2019-12-07 11:30:05,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:05,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263686432] [2019-12-07 11:30:05,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:05,850 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 11:30:05,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263686432] [2019-12-07 11:30:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:05,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641107563] [2019-12-07 11:30:05,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:05,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:05,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:05,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:05,851 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-12-07 11:30:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:06,123 INFO L93 Difference]: Finished difference Result 550 states and 826 transitions. [2019-12-07 11:30:06,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:06,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 11:30:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:06,125 INFO L225 Difference]: With dead ends: 550 [2019-12-07 11:30:06,125 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 11:30:06,125 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 11:30:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 11:30:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-12-07 11:30:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-12-07 11:30:06,130 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 99 [2019-12-07 11:30:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:06,131 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-12-07 11:30:06,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-12-07 11:30:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:30:06,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:06,132 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:06,132 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash -292906955, now seen corresponding path program 1 times [2019-12-07 11:30:06,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:06,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90010882] [2019-12-07 11:30:06,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:06,171 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 11:30:06,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90010882] [2019-12-07 11:30:06,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:06,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:06,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378336347] [2019-12-07 11:30:06,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:06,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:06,172 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-12-07 11:30:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:06,397 INFO L93 Difference]: Finished difference Result 516 states and 775 transitions. [2019-12-07 11:30:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:06,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 11:30:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:06,398 INFO L225 Difference]: With dead ends: 516 [2019-12-07 11:30:06,398 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 11:30:06,399 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 11:30:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 11:30:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-12-07 11:30:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-12-07 11:30:06,402 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 99 [2019-12-07 11:30:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:06,403 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-12-07 11:30:06,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-12-07 11:30:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:30:06,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:06,403 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:06,404 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:06,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1049348212, now seen corresponding path program 1 times [2019-12-07 11:30:06,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:06,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32607127] [2019-12-07 11:30:06,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:06,434 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 11:30:06,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32607127] [2019-12-07 11:30:06,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:06,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:06,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539911113] [2019-12-07 11:30:06,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:06,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:06,435 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-12-07 11:30:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:06,704 INFO L93 Difference]: Finished difference Result 540 states and 810 transitions. [2019-12-07 11:30:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:06,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 11:30:06,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:06,706 INFO L225 Difference]: With dead ends: 540 [2019-12-07 11:30:06,706 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 11:30:06,706 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 11:30:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 11:30:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2019-12-07 11:30:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-12-07 11:30:06,711 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 100 [2019-12-07 11:30:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:06,711 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-12-07 11:30:06,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-12-07 11:30:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:30:06,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:06,712 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:06,712 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1610047990, now seen corresponding path program 1 times [2019-12-07 11:30:06,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:06,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092466067] [2019-12-07 11:30:06,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:06,748 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 11:30:06,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092466067] [2019-12-07 11:30:06,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:06,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:06,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563348513] [2019-12-07 11:30:06,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:06,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:06,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:06,749 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-12-07 11:30:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:07,060 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-12-07 11:30:07,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:07,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 11:30:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:07,062 INFO L225 Difference]: With dead ends: 506 [2019-12-07 11:30:07,062 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 11:30:07,063 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 11:30:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 11:30:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2019-12-07 11:30:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-12-07 11:30:07,067 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 100 [2019-12-07 11:30:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:07,067 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-12-07 11:30:07,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-12-07 11:30:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 11:30:07,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:07,068 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 11:30:07,068 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1540193984, now seen corresponding path program 1 times [2019-12-07 11:30:07,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:07,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644804735] [2019-12-07 11:30:07,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:07,103 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 11:30:07,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644804735] [2019-12-07 11:30:07,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:07,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:07,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011858471] [2019-12-07 11:30:07,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:07,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:07,104 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-12-07 11:30:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:07,370 INFO L93 Difference]: Finished difference Result 540 states and 806 transitions. [2019-12-07 11:30:07,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:07,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 11:30:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:07,371 INFO L225 Difference]: With dead ends: 540 [2019-12-07 11:30:07,371 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 11:30:07,372 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 11:30:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 11:30:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2019-12-07 11:30:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 11:30:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-12-07 11:30:07,376 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 104 [2019-12-07 11:30:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:07,376 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-12-07 11:30:07,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-12-07 11:30:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 11:30:07,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:07,377 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 11:30:07,377 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1957590590, now seen corresponding path program 1 times [2019-12-07 11:30:07,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:07,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409044510] [2019-12-07 11:30:07,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:07,414 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 11:30:07,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409044510] [2019-12-07 11:30:07,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:07,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:07,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127955951] [2019-12-07 11:30:07,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:07,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:07,416 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 4 states. [2019-12-07 11:30:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:07,671 INFO L93 Difference]: Finished difference Result 547 states and 819 transitions. [2019-12-07 11:30:07,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:07,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 11:30:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:07,673 INFO L225 Difference]: With dead ends: 547 [2019-12-07 11:30:07,673 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 11:30:07,673 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 11:30:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 11:30:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-12-07 11:30:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 426 transitions. [2019-12-07 11:30:07,677 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 426 transitions. Word has length 104 [2019-12-07 11:30:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:07,677 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 426 transitions. [2019-12-07 11:30:07,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 426 transitions. [2019-12-07 11:30:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 11:30:07,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:07,678 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] [2019-12-07 11:30:07,678 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1642233629, now seen corresponding path program 1 times [2019-12-07 11:30:07,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:07,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110453844] [2019-12-07 11:30:07,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:07,721 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 11:30:07,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110453844] [2019-12-07 11:30:07,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:07,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:07,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911718062] [2019-12-07 11:30:07,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:07,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:07,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:07,722 INFO L87 Difference]: Start difference. First operand 283 states and 426 transitions. Second operand 4 states. [2019-12-07 11:30:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:07,995 INFO L93 Difference]: Finished difference Result 592 states and 894 transitions. [2019-12-07 11:30:07,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:07,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 11:30:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:07,997 INFO L225 Difference]: With dead ends: 592 [2019-12-07 11:30:07,997 INFO L226 Difference]: Without dead ends: 328 [2019-12-07 11:30:07,997 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 11:30:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-07 11:30:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 283. [2019-12-07 11:30:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 425 transitions. [2019-12-07 11:30:08,002 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 425 transitions. Word has length 107 [2019-12-07 11:30:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:08,002 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 425 transitions. [2019-12-07 11:30:08,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 425 transitions. [2019-12-07 11:30:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 11:30:08,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:08,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:08,003 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 35471872, now seen corresponding path program 1 times [2019-12-07 11:30:08,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:08,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100898338] [2019-12-07 11:30:08,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:08,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100898338] [2019-12-07 11:30:08,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:08,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:08,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446271912] [2019-12-07 11:30:08,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:08,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:08,042 INFO L87 Difference]: Start difference. First operand 283 states and 425 transitions. Second operand 4 states. [2019-12-07 11:30:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:08,323 INFO L93 Difference]: Finished difference Result 584 states and 879 transitions. [2019-12-07 11:30:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:08,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 11:30:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:08,324 INFO L225 Difference]: With dead ends: 584 [2019-12-07 11:30:08,324 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 11:30:08,325 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 11:30:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 11:30:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-12-07 11:30:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 424 transitions. [2019-12-07 11:30:08,329 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 424 transitions. Word has length 108 [2019-12-07 11:30:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:08,329 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 424 transitions. [2019-12-07 11:30:08,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 424 transitions. [2019-12-07 11:30:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 11:30:08,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:08,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:08,330 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1751499325, now seen corresponding path program 1 times [2019-12-07 11:30:08,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:08,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208348067] [2019-12-07 11:30:08,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:08,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208348067] [2019-12-07 11:30:08,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:08,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:08,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560487774] [2019-12-07 11:30:08,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:08,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:08,369 INFO L87 Difference]: Start difference. First operand 283 states and 424 transitions. Second operand 4 states. [2019-12-07 11:30:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:08,610 INFO L93 Difference]: Finished difference Result 584 states and 877 transitions. [2019-12-07 11:30:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:08,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 11:30:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:08,612 INFO L225 Difference]: With dead ends: 584 [2019-12-07 11:30:08,612 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 11:30:08,612 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 11:30:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 11:30:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-12-07 11:30:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 423 transitions. [2019-12-07 11:30:08,617 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 423 transitions. Word has length 109 [2019-12-07 11:30:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:08,617 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 423 transitions. [2019-12-07 11:30:08,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 423 transitions. [2019-12-07 11:30:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 11:30:08,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:08,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:08,618 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1247479925, now seen corresponding path program 1 times [2019-12-07 11:30:08,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:08,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241041155] [2019-12-07 11:30:08,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:08,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241041155] [2019-12-07 11:30:08,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:08,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:08,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840917525] [2019-12-07 11:30:08,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:08,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:08,655 INFO L87 Difference]: Start difference. First operand 283 states and 423 transitions. Second operand 4 states. [2019-12-07 11:30:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:08,909 INFO L93 Difference]: Finished difference Result 584 states and 875 transitions. [2019-12-07 11:30:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:08,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 11:30:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:08,911 INFO L225 Difference]: With dead ends: 584 [2019-12-07 11:30:08,911 INFO L226 Difference]: Without dead ends: 320 [2019-12-07 11:30:08,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 11:30:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-07 11:30:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-12-07 11:30:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 422 transitions. [2019-12-07 11:30:08,915 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 422 transitions. Word has length 110 [2019-12-07 11:30:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:08,915 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 422 transitions. [2019-12-07 11:30:08,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 422 transitions. [2019-12-07 11:30:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 11:30:08,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:08,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:08,916 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1790632826, now seen corresponding path program 1 times [2019-12-07 11:30:08,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:08,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051608377] [2019-12-07 11:30:08,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:08,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051608377] [2019-12-07 11:30:08,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:08,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:08,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76093233] [2019-12-07 11:30:08,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:08,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:08,961 INFO L87 Difference]: Start difference. First operand 283 states and 422 transitions. Second operand 4 states. [2019-12-07 11:30:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:09,225 INFO L93 Difference]: Finished difference Result 582 states and 871 transitions. [2019-12-07 11:30:09,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:09,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 11:30:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:09,226 INFO L225 Difference]: With dead ends: 582 [2019-12-07 11:30:09,227 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 11:30:09,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 11:30:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 11:30:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-12-07 11:30:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 421 transitions. [2019-12-07 11:30:09,231 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 421 transitions. Word has length 110 [2019-12-07 11:30:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:09,231 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 421 transitions. [2019-12-07 11:30:09,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 421 transitions. [2019-12-07 11:30:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 11:30:09,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:09,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:09,232 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1521793640, now seen corresponding path program 1 times [2019-12-07 11:30:09,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:09,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576534072] [2019-12-07 11:30:09,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:09,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576534072] [2019-12-07 11:30:09,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:09,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:09,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289779304] [2019-12-07 11:30:09,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:09,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:09,273 INFO L87 Difference]: Start difference. First operand 283 states and 421 transitions. Second operand 4 states. [2019-12-07 11:30:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:09,517 INFO L93 Difference]: Finished difference Result 580 states and 866 transitions. [2019-12-07 11:30:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:09,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 11:30:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:09,519 INFO L225 Difference]: With dead ends: 580 [2019-12-07 11:30:09,519 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 11:30:09,519 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 11:30:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 11:30:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2019-12-07 11:30:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2019-12-07 11:30:09,524 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 111 [2019-12-07 11:30:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:09,524 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2019-12-07 11:30:09,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2019-12-07 11:30:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 11:30:09,524 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:09,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:09,525 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:09,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash 244047579, now seen corresponding path program 1 times [2019-12-07 11:30:09,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:09,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548394666] [2019-12-07 11:30:09,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:09,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548394666] [2019-12-07 11:30:09,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:09,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:09,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857471827] [2019-12-07 11:30:09,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:09,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:09,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:09,565 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand 4 states. [2019-12-07 11:30:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:09,786 INFO L93 Difference]: Finished difference Result 577 states and 860 transitions. [2019-12-07 11:30:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:09,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 11:30:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:09,788 INFO L225 Difference]: With dead ends: 577 [2019-12-07 11:30:09,788 INFO L226 Difference]: Without dead ends: 313 [2019-12-07 11:30:09,788 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 11:30:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-07 11:30:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2019-12-07 11:30:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2019-12-07 11:30:09,793 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2019-12-07 11:30:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:09,793 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2019-12-07 11:30:09,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2019-12-07 11:30:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 11:30:09,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:09,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:09,794 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:09,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash -344193252, now seen corresponding path program 1 times [2019-12-07 11:30:09,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:09,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213057895] [2019-12-07 11:30:09,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:09,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213057895] [2019-12-07 11:30:09,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:09,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:09,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438691161] [2019-12-07 11:30:09,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:09,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:09,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:09,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:09,837 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 4 states. [2019-12-07 11:30:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:10,070 INFO L93 Difference]: Finished difference Result 577 states and 858 transitions. [2019-12-07 11:30:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:10,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 11:30:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:10,071 INFO L225 Difference]: With dead ends: 577 [2019-12-07 11:30:10,071 INFO L226 Difference]: Without dead ends: 313 [2019-12-07 11:30:10,072 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 11:30:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-07 11:30:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2019-12-07 11:30:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2019-12-07 11:30:10,076 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 113 [2019-12-07 11:30:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:10,076 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2019-12-07 11:30:10,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2019-12-07 11:30:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 11:30:10,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:10,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:10,077 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:10,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:10,077 INFO L82 PathProgramCache]: Analyzing trace with hash -574798082, now seen corresponding path program 1 times [2019-12-07 11:30:10,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:10,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371498341] [2019-12-07 11:30:10,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:10,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371498341] [2019-12-07 11:30:10,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:10,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:10,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889280728] [2019-12-07 11:30:10,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:10,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:10,117 INFO L87 Difference]: Start difference. First operand 283 states and 418 transitions. Second operand 4 states. [2019-12-07 11:30:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:10,360 INFO L93 Difference]: Finished difference Result 573 states and 851 transitions. [2019-12-07 11:30:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:10,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 11:30:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:10,362 INFO L225 Difference]: With dead ends: 573 [2019-12-07 11:30:10,362 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 11:30:10,363 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 11:30:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 11:30:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-12-07 11:30:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2019-12-07 11:30:10,368 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 114 [2019-12-07 11:30:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:10,368 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2019-12-07 11:30:10,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2019-12-07 11:30:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 11:30:10,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:10,369 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, 1, 1, 1, 1, 1, 1, 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 11:30:10,369 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -53439120, now seen corresponding path program 1 times [2019-12-07 11:30:10,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:10,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238558698] [2019-12-07 11:30:10,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:10,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238558698] [2019-12-07 11:30:10,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:10,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:10,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095477556] [2019-12-07 11:30:10,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:10,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:10,411 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand 4 states. [2019-12-07 11:30:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:10,790 INFO L93 Difference]: Finished difference Result 573 states and 849 transitions. [2019-12-07 11:30:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:10,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 11:30:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:10,794 INFO L225 Difference]: With dead ends: 573 [2019-12-07 11:30:10,794 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 11:30:10,794 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 11:30:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 11:30:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-12-07 11:30:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2019-12-07 11:30:10,805 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2019-12-07 11:30:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:10,806 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2019-12-07 11:30:10,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:10,806 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2019-12-07 11:30:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 11:30:10,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:10,807 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, 1, 1, 1, 1, 1, 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 11:30:10,807 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash -235371218, now seen corresponding path program 1 times [2019-12-07 11:30:10,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:10,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047469130] [2019-12-07 11:30:10,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:10,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047469130] [2019-12-07 11:30:10,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:10,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:10,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147342172] [2019-12-07 11:30:10,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:10,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:10,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:10,860 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand 4 states. [2019-12-07 11:30:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:11,201 INFO L93 Difference]: Finished difference Result 571 states and 845 transitions. [2019-12-07 11:30:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:11,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 11:30:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:11,207 INFO L225 Difference]: With dead ends: 571 [2019-12-07 11:30:11,207 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 11:30:11,208 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 11:30:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 11:30:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-12-07 11:30:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2019-12-07 11:30:11,223 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 115 [2019-12-07 11:30:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:11,224 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2019-12-07 11:30:11,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2019-12-07 11:30:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 11:30:11,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:11,226 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, 1, 1, 1, 1, 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 11:30:11,226 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash 16472555, now seen corresponding path program 1 times [2019-12-07 11:30:11,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:11,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507724500] [2019-12-07 11:30:11,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:11,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507724500] [2019-12-07 11:30:11,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:11,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:11,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406800958] [2019-12-07 11:30:11,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:11,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:11,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:11,282 INFO L87 Difference]: Start difference. First operand 283 states and 415 transitions. Second operand 4 states. [2019-12-07 11:30:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:11,495 INFO L93 Difference]: Finished difference Result 571 states and 843 transitions. [2019-12-07 11:30:11,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:11,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 11:30:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:11,497 INFO L225 Difference]: With dead ends: 571 [2019-12-07 11:30:11,497 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 11:30:11,497 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 11:30:11,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 11:30:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-12-07 11:30:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2019-12-07 11:30:11,502 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 116 [2019-12-07 11:30:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:11,502 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2019-12-07 11:30:11,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2019-12-07 11:30:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 11:30:11,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:11,503 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, 1, 1, 1, 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 11:30:11,503 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:11,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash -349731447, now seen corresponding path program 1 times [2019-12-07 11:30:11,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:11,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087762383] [2019-12-07 11:30:11,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:11,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087762383] [2019-12-07 11:30:11,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:11,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:11,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026095902] [2019-12-07 11:30:11,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:11,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:11,545 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand 4 states. [2019-12-07 11:30:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:11,770 INFO L93 Difference]: Finished difference Result 569 states and 839 transitions. [2019-12-07 11:30:11,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:11,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 11:30:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:11,772 INFO L225 Difference]: With dead ends: 569 [2019-12-07 11:30:11,772 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 11:30:11,773 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 11:30:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 11:30:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2019-12-07 11:30:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 11:30:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2019-12-07 11:30:11,777 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 117 [2019-12-07 11:30:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:11,778 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2019-12-07 11:30:11,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2019-12-07 11:30:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 11:30:11,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:11,778 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:11,778 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash 629494119, now seen corresponding path program 1 times [2019-12-07 11:30:11,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:11,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94398206] [2019-12-07 11:30:11,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 11:30:11,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94398206] [2019-12-07 11:30:11,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:11,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:11,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980990853] [2019-12-07 11:30:11,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:11,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:11,818 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand 4 states. [2019-12-07 11:30:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:12,091 INFO L93 Difference]: Finished difference Result 618 states and 914 transitions. [2019-12-07 11:30:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:12,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 11:30:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:12,093 INFO L225 Difference]: With dead ends: 618 [2019-12-07 11:30:12,093 INFO L226 Difference]: Without dead ends: 354 [2019-12-07 11:30:12,094 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 11:30:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-07 11:30:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2019-12-07 11:30:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-07 11:30:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2019-12-07 11:30:12,099 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 117 [2019-12-07 11:30:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:12,099 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2019-12-07 11:30:12,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2019-12-07 11:30:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 11:30:12,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:12,100 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:12,100 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:12,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1118786538, now seen corresponding path program 1 times [2019-12-07 11:30:12,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:12,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307367600] [2019-12-07 11:30:12,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:12,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307367600] [2019-12-07 11:30:12,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:12,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:12,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819561870] [2019-12-07 11:30:12,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:12,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:12,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:12,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:12,141 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand 4 states. [2019-12-07 11:30:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:12,456 INFO L93 Difference]: Finished difference Result 717 states and 1082 transitions. [2019-12-07 11:30:12,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:12,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 11:30:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:12,458 INFO L225 Difference]: With dead ends: 717 [2019-12-07 11:30:12,458 INFO L226 Difference]: Without dead ends: 421 [2019-12-07 11:30:12,458 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 11:30:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-07 11:30:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 354. [2019-12-07 11:30:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-07 11:30:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 541 transitions. [2019-12-07 11:30:12,464 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 541 transitions. Word has length 118 [2019-12-07 11:30:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:12,464 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 541 transitions. [2019-12-07 11:30:12,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 541 transitions. [2019-12-07 11:30:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 11:30:12,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:12,465 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:12,465 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1992730650, now seen corresponding path program 1 times [2019-12-07 11:30:12,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:12,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425154142] [2019-12-07 11:30:12,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:12,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425154142] [2019-12-07 11:30:12,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:12,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:12,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427924264] [2019-12-07 11:30:12,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:12,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:12,505 INFO L87 Difference]: Start difference. First operand 354 states and 541 transitions. Second operand 4 states. [2019-12-07 11:30:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:12,812 INFO L93 Difference]: Finished difference Result 748 states and 1141 transitions. [2019-12-07 11:30:12,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:12,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 11:30:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:12,814 INFO L225 Difference]: With dead ends: 748 [2019-12-07 11:30:12,814 INFO L226 Difference]: Without dead ends: 413 [2019-12-07 11:30:12,814 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 11:30:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-12-07 11:30:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 353. [2019-12-07 11:30:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 11:30:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 540 transitions. [2019-12-07 11:30:12,820 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 540 transitions. Word has length 119 [2019-12-07 11:30:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:12,820 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 540 transitions. [2019-12-07 11:30:12,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 540 transitions. [2019-12-07 11:30:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 11:30:12,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:12,821 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:12,821 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash 375832611, now seen corresponding path program 1 times [2019-12-07 11:30:12,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:12,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65919193] [2019-12-07 11:30:12,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:12,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65919193] [2019-12-07 11:30:12,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:12,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:12,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26890969] [2019-12-07 11:30:12,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:12,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:12,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:12,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:12,856 INFO L87 Difference]: Start difference. First operand 353 states and 540 transitions. Second operand 4 states. [2019-12-07 11:30:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:13,075 INFO L93 Difference]: Finished difference Result 713 states and 1091 transitions. [2019-12-07 11:30:13,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:13,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 11:30:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:13,077 INFO L225 Difference]: With dead ends: 713 [2019-12-07 11:30:13,077 INFO L226 Difference]: Without dead ends: 379 [2019-12-07 11:30:13,077 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 11:30:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-07 11:30:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-12-07 11:30:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 11:30:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2019-12-07 11:30:13,083 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 119 [2019-12-07 11:30:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:13,083 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2019-12-07 11:30:13,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2019-12-07 11:30:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 11:30:13,084 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:13,084 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:13,084 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash -239737582, now seen corresponding path program 1 times [2019-12-07 11:30:13,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:13,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645329718] [2019-12-07 11:30:13,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:13,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645329718] [2019-12-07 11:30:13,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:13,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:13,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988652915] [2019-12-07 11:30:13,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:13,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:13,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:13,120 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand 4 states. [2019-12-07 11:30:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:13,336 INFO L93 Difference]: Finished difference Result 713 states and 1089 transitions. [2019-12-07 11:30:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:13,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 11:30:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:13,338 INFO L225 Difference]: With dead ends: 713 [2019-12-07 11:30:13,338 INFO L226 Difference]: Without dead ends: 379 [2019-12-07 11:30:13,338 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 11:30:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-07 11:30:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-12-07 11:30:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 11:30:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 538 transitions. [2019-12-07 11:30:13,343 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 538 transitions. Word has length 120 [2019-12-07 11:30:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:13,344 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 538 transitions. [2019-12-07 11:30:13,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 538 transitions. [2019-12-07 11:30:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 11:30:13,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:13,344 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:13,345 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1589606562, now seen corresponding path program 1 times [2019-12-07 11:30:13,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:13,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839693894] [2019-12-07 11:30:13,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:13,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839693894] [2019-12-07 11:30:13,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:13,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:13,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77058429] [2019-12-07 11:30:13,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:13,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:13,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:13,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:13,383 INFO L87 Difference]: Start difference. First operand 353 states and 538 transitions. Second operand 4 states. [2019-12-07 11:30:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:13,595 INFO L93 Difference]: Finished difference Result 713 states and 1087 transitions. [2019-12-07 11:30:13,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:13,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 11:30:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:13,596 INFO L225 Difference]: With dead ends: 713 [2019-12-07 11:30:13,596 INFO L226 Difference]: Without dead ends: 379 [2019-12-07 11:30:13,597 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 11:30:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-07 11:30:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-12-07 11:30:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 11:30:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 537 transitions. [2019-12-07 11:30:13,602 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 537 transitions. Word has length 121 [2019-12-07 11:30:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:13,603 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 537 transitions. [2019-12-07 11:30:13,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 537 transitions. [2019-12-07 11:30:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 11:30:13,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:13,603 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:13,604 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:13,604 INFO L82 PathProgramCache]: Analyzing trace with hash 67065837, now seen corresponding path program 1 times [2019-12-07 11:30:13,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:13,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136529994] [2019-12-07 11:30:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:13,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136529994] [2019-12-07 11:30:13,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:13,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:13,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931235333] [2019-12-07 11:30:13,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:13,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:13,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:13,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:13,639 INFO L87 Difference]: Start difference. First operand 353 states and 537 transitions. Second operand 4 states. [2019-12-07 11:30:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:13,863 INFO L93 Difference]: Finished difference Result 703 states and 1073 transitions. [2019-12-07 11:30:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:13,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 11:30:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:13,865 INFO L225 Difference]: With dead ends: 703 [2019-12-07 11:30:13,865 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 11:30:13,865 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 11:30:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 11:30:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2019-12-07 11:30:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 11:30:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2019-12-07 11:30:13,871 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 122 [2019-12-07 11:30:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:13,871 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2019-12-07 11:30:13,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2019-12-07 11:30:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 11:30:13,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:13,872 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, 1, 1] [2019-12-07 11:30:13,872 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:13,872 INFO L82 PathProgramCache]: Analyzing trace with hash -184111027, now seen corresponding path program 1 times [2019-12-07 11:30:13,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:13,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035086779] [2019-12-07 11:30:13,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:13,912 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 11:30:13,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035086779] [2019-12-07 11:30:13,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:13,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:13,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69190606] [2019-12-07 11:30:13,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:13,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:13,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:13,913 INFO L87 Difference]: Start difference. First operand 353 states and 536 transitions. Second operand 4 states. [2019-12-07 11:30:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:14,233 INFO L93 Difference]: Finished difference Result 793 states and 1214 transitions. [2019-12-07 11:30:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:14,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 11:30:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:14,235 INFO L225 Difference]: With dead ends: 793 [2019-12-07 11:30:14,235 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 11:30:14,235 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 11:30:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 11:30:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 392. [2019-12-07 11:30:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-12-07 11:30:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2019-12-07 11:30:14,242 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 123 [2019-12-07 11:30:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:14,242 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2019-12-07 11:30:14,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2019-12-07 11:30:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 11:30:14,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:14,243 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, 2, 1, 1, 1, 1, 1, 1, 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 11:30:14,243 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:14,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:14,243 INFO L82 PathProgramCache]: Analyzing trace with hash 902900419, now seen corresponding path program 1 times [2019-12-07 11:30:14,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:14,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139948518] [2019-12-07 11:30:14,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:14,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139948518] [2019-12-07 11:30:14,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:14,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:14,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857195719] [2019-12-07 11:30:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:14,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:14,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:14,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:14,284 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand 4 states. [2019-12-07 11:30:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:14,590 INFO L93 Difference]: Finished difference Result 824 states and 1273 transitions. [2019-12-07 11:30:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:14,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-12-07 11:30:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:14,592 INFO L225 Difference]: With dead ends: 824 [2019-12-07 11:30:14,592 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 11:30:14,593 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 11:30:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 11:30:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2019-12-07 11:30:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 11:30:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2019-12-07 11:30:14,599 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 124 [2019-12-07 11:30:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:14,599 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2019-12-07 11:30:14,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2019-12-07 11:30:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 11:30:14,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:14,600 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, 1, 1, 1, 1] [2019-12-07 11:30:14,600 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:14,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash 155929017, now seen corresponding path program 1 times [2019-12-07 11:30:14,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:14,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318263396] [2019-12-07 11:30:14,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:30:14,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318263396] [2019-12-07 11:30:14,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:14,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:14,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375076054] [2019-12-07 11:30:14,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:14,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:14,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:14,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:14,668 INFO L87 Difference]: Start difference. First operand 353 states and 536 transitions. Second operand 4 states. [2019-12-07 11:30:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:14,884 INFO L93 Difference]: Finished difference Result 702 states and 1070 transitions. [2019-12-07 11:30:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:14,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-12-07 11:30:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:14,886 INFO L225 Difference]: With dead ends: 702 [2019-12-07 11:30:14,886 INFO L226 Difference]: Without dead ends: 368 [2019-12-07 11:30:14,887 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 11:30:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-07 11:30:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2019-12-07 11:30:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 11:30:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2019-12-07 11:30:14,893 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 125 [2019-12-07 11:30:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:14,893 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2019-12-07 11:30:14,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2019-12-07 11:30:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 11:30:14,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:14,894 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:14,894 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 911219166, now seen corresponding path program 1 times [2019-12-07 11:30:14,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:14,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965501706] [2019-12-07 11:30:14,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 11:30:14,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965501706] [2019-12-07 11:30:14,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:14,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:14,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973704483] [2019-12-07 11:30:14,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:14,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:14,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:14,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:14,938 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand 4 states. [2019-12-07 11:30:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:15,157 INFO L93 Difference]: Finished difference Result 709 states and 1077 transitions. [2019-12-07 11:30:15,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:15,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 11:30:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:15,159 INFO L225 Difference]: With dead ends: 709 [2019-12-07 11:30:15,159 INFO L226 Difference]: Without dead ends: 372 [2019-12-07 11:30:15,160 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 11:30:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-07 11:30:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2019-12-07 11:30:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 11:30:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 538 transitions. [2019-12-07 11:30:15,166 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 538 transitions. Word has length 132 [2019-12-07 11:30:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:15,166 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 538 transitions. [2019-12-07 11:30:15,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions. [2019-12-07 11:30:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 11:30:15,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:15,167 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, 1, 1, 1, 1, 1] [2019-12-07 11:30:15,167 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:15,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:15,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1006654638, now seen corresponding path program 1 times [2019-12-07 11:30:15,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:15,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648339562] [2019-12-07 11:30:15,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:15,210 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 11:30:15,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648339562] [2019-12-07 11:30:15,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:15,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:15,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421756337] [2019-12-07 11:30:15,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:15,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:15,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:15,211 INFO L87 Difference]: Start difference. First operand 356 states and 538 transitions. Second operand 4 states. [2019-12-07 11:30:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:15,474 INFO L93 Difference]: Finished difference Result 755 states and 1150 transitions. [2019-12-07 11:30:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:15,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 11:30:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:15,477 INFO L225 Difference]: With dead ends: 755 [2019-12-07 11:30:15,477 INFO L226 Difference]: Without dead ends: 418 [2019-12-07 11:30:15,478 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 11:30:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-07 11:30:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2019-12-07 11:30:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 11:30:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 587 transitions. [2019-12-07 11:30:15,488 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 587 transitions. Word has length 132 [2019-12-07 11:30:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:15,488 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 587 transitions. [2019-12-07 11:30:15,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 587 transitions. [2019-12-07 11:30:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 11:30:15,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:15,489 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:15,489 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1878018703, now seen corresponding path program 1 times [2019-12-07 11:30:15,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:15,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894719850] [2019-12-07 11:30:15,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 11:30:15,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894719850] [2019-12-07 11:30:15,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:15,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:15,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197104755] [2019-12-07 11:30:15,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:15,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:15,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:15,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:15,532 INFO L87 Difference]: Start difference. First operand 384 states and 587 transitions. Second operand 4 states. [2019-12-07 11:30:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:15,751 INFO L93 Difference]: Finished difference Result 763 states and 1171 transitions. [2019-12-07 11:30:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:15,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 11:30:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:15,753 INFO L225 Difference]: With dead ends: 763 [2019-12-07 11:30:15,753 INFO L226 Difference]: Without dead ends: 398 [2019-12-07 11:30:15,754 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 11:30:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-07 11:30:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2019-12-07 11:30:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 11:30:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2019-12-07 11:30:15,760 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 133 [2019-12-07 11:30:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:15,761 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2019-12-07 11:30:15,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2019-12-07 11:30:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 11:30:15,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:15,761 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:15,761 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:15,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash 702294863, now seen corresponding path program 1 times [2019-12-07 11:30:15,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:15,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927613620] [2019-12-07 11:30:15,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:15,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927613620] [2019-12-07 11:30:15,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:15,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:15,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044752169] [2019-12-07 11:30:15,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:15,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:15,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:15,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:15,796 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand 4 states. [2019-12-07 11:30:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:16,071 INFO L93 Difference]: Finished difference Result 847 states and 1301 transitions. [2019-12-07 11:30:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:16,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 11:30:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:16,073 INFO L225 Difference]: With dead ends: 847 [2019-12-07 11:30:16,073 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:30:16,074 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 11:30:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:30:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 396. [2019-12-07 11:30:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-12-07 11:30:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 603 transitions. [2019-12-07 11:30:16,081 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 603 transitions. Word has length 133 [2019-12-07 11:30:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:16,081 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 603 transitions. [2019-12-07 11:30:16,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 603 transitions. [2019-12-07 11:30:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 11:30:16,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:16,082 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:16,082 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1290657638, now seen corresponding path program 1 times [2019-12-07 11:30:16,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:16,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750541355] [2019-12-07 11:30:16,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:16,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750541355] [2019-12-07 11:30:16,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:16,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:16,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488805219] [2019-12-07 11:30:16,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:16,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:16,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:16,119 INFO L87 Difference]: Start difference. First operand 396 states and 603 transitions. Second operand 4 states. [2019-12-07 11:30:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:16,401 INFO L93 Difference]: Finished difference Result 859 states and 1317 transitions. [2019-12-07 11:30:16,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:16,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 11:30:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:16,403 INFO L225 Difference]: With dead ends: 859 [2019-12-07 11:30:16,403 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:30:16,403 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 11:30:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:30:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 397. [2019-12-07 11:30:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-07 11:30:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 604 transitions. [2019-12-07 11:30:16,414 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 604 transitions. Word has length 134 [2019-12-07 11:30:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:16,414 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 604 transitions. [2019-12-07 11:30:16,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 604 transitions. [2019-12-07 11:30:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 11:30:16,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:16,415 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:16,416 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1391994998, now seen corresponding path program 1 times [2019-12-07 11:30:16,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:16,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685694850] [2019-12-07 11:30:16,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:16,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685694850] [2019-12-07 11:30:16,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:16,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:16,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970959557] [2019-12-07 11:30:16,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:16,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:16,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:16,461 INFO L87 Difference]: Start difference. First operand 397 states and 604 transitions. Second operand 4 states. [2019-12-07 11:30:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:16,741 INFO L93 Difference]: Finished difference Result 860 states and 1317 transitions. [2019-12-07 11:30:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:16,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-12-07 11:30:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:16,743 INFO L225 Difference]: With dead ends: 860 [2019-12-07 11:30:16,743 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:30:16,743 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 11:30:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:30:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 398. [2019-12-07 11:30:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-12-07 11:30:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 605 transitions. [2019-12-07 11:30:16,751 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 605 transitions. Word has length 135 [2019-12-07 11:30:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:16,751 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 605 transitions. [2019-12-07 11:30:16,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 605 transitions. [2019-12-07 11:30:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 11:30:16,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:16,752 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:16,752 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:16,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:16,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1898057025, now seen corresponding path program 1 times [2019-12-07 11:30:16,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:16,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040207480] [2019-12-07 11:30:16,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:16,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040207480] [2019-12-07 11:30:16,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:16,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:16,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130619900] [2019-12-07 11:30:16,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:16,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:16,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:16,788 INFO L87 Difference]: Start difference. First operand 398 states and 605 transitions. Second operand 4 states. [2019-12-07 11:30:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:17,060 INFO L93 Difference]: Finished difference Result 851 states and 1305 transitions. [2019-12-07 11:30:17,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:17,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 11:30:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:17,062 INFO L225 Difference]: With dead ends: 851 [2019-12-07 11:30:17,062 INFO L226 Difference]: Without dead ends: 472 [2019-12-07 11:30:17,062 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 11:30:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-12-07 11:30:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 399. [2019-12-07 11:30:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 11:30:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 606 transitions. [2019-12-07 11:30:17,070 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 606 transitions. Word has length 136 [2019-12-07 11:30:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:17,070 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 606 transitions. [2019-12-07 11:30:17,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 606 transitions. [2019-12-07 11:30:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 11:30:17,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:17,071 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:17,071 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1925950920, now seen corresponding path program 1 times [2019-12-07 11:30:17,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:17,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318042507] [2019-12-07 11:30:17,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:17,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318042507] [2019-12-07 11:30:17,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:17,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:17,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134909461] [2019-12-07 11:30:17,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:17,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:17,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:17,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:17,117 INFO L87 Difference]: Start difference. First operand 399 states and 606 transitions. Second operand 4 states. [2019-12-07 11:30:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:17,427 INFO L93 Difference]: Finished difference Result 862 states and 1317 transitions. [2019-12-07 11:30:17,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:17,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-12-07 11:30:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:17,429 INFO L225 Difference]: With dead ends: 862 [2019-12-07 11:30:17,429 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:30:17,430 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 11:30:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:30:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-12-07 11:30:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 11:30:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 605 transitions. [2019-12-07 11:30:17,438 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 605 transitions. Word has length 138 [2019-12-07 11:30:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:17,438 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 605 transitions. [2019-12-07 11:30:17,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 605 transitions. [2019-12-07 11:30:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 11:30:17,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:17,439 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:17,439 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1419416989, now seen corresponding path program 1 times [2019-12-07 11:30:17,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:17,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865983119] [2019-12-07 11:30:17,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:17,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865983119] [2019-12-07 11:30:17,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:17,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:17,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087060392] [2019-12-07 11:30:17,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:17,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:17,475 INFO L87 Difference]: Start difference. First operand 399 states and 605 transitions. Second operand 4 states. [2019-12-07 11:30:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:17,784 INFO L93 Difference]: Finished difference Result 862 states and 1315 transitions. [2019-12-07 11:30:17,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:17,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-12-07 11:30:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:17,786 INFO L225 Difference]: With dead ends: 862 [2019-12-07 11:30:17,786 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:30:17,786 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 11:30:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:30:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-12-07 11:30:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 11:30:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 604 transitions. [2019-12-07 11:30:17,795 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 604 transitions. Word has length 139 [2019-12-07 11:30:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:17,795 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 604 transitions. [2019-12-07 11:30:17,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 604 transitions. [2019-12-07 11:30:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 11:30:17,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:17,796 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:17,796 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:17,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1695422413, now seen corresponding path program 1 times [2019-12-07 11:30:17,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:17,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864393343] [2019-12-07 11:30:17,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:17,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864393343] [2019-12-07 11:30:17,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:17,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:17,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690877373] [2019-12-07 11:30:17,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:17,832 INFO L87 Difference]: Start difference. First operand 399 states and 604 transitions. Second operand 4 states. [2019-12-07 11:30:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:18,161 INFO L93 Difference]: Finished difference Result 862 states and 1313 transitions. [2019-12-07 11:30:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:18,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-12-07 11:30:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:18,164 INFO L225 Difference]: With dead ends: 862 [2019-12-07 11:30:18,164 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 11:30:18,164 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 11:30:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 11:30:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-12-07 11:30:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 11:30:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 603 transitions. [2019-12-07 11:30:18,175 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 603 transitions. Word has length 140 [2019-12-07 11:30:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:18,175 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 603 transitions. [2019-12-07 11:30:18,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 603 transitions. [2019-12-07 11:30:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 11:30:18,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:18,177 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:18,177 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:18,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1081741752, now seen corresponding path program 1 times [2019-12-07 11:30:18,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:18,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751098443] [2019-12-07 11:30:18,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:18,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751098443] [2019-12-07 11:30:18,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:18,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:18,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819208694] [2019-12-07 11:30:18,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:18,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:18,221 INFO L87 Difference]: Start difference. First operand 399 states and 603 transitions. Second operand 4 states. [2019-12-07 11:30:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:18,542 INFO L93 Difference]: Finished difference Result 852 states and 1299 transitions. [2019-12-07 11:30:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:18,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 11:30:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:18,545 INFO L225 Difference]: With dead ends: 852 [2019-12-07 11:30:18,545 INFO L226 Difference]: Without dead ends: 472 [2019-12-07 11:30:18,545 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 11:30:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-12-07 11:30:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 384. [2019-12-07 11:30:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 11:30:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 582 transitions. [2019-12-07 11:30:18,557 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 582 transitions. Word has length 141 [2019-12-07 11:30:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:18,557 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 582 transitions. [2019-12-07 11:30:18,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 582 transitions. [2019-12-07 11:30:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 11:30:18,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:18,558 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:18,558 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:18,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1979951990, now seen corresponding path program 1 times [2019-12-07 11:30:18,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:18,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931321667] [2019-12-07 11:30:18,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:18,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931321667] [2019-12-07 11:30:18,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:18,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:18,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928948134] [2019-12-07 11:30:18,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:18,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:18,617 INFO L87 Difference]: Start difference. First operand 384 states and 582 transitions. Second operand 4 states. [2019-12-07 11:30:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:18,891 INFO L93 Difference]: Finished difference Result 837 states and 1277 transitions. [2019-12-07 11:30:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:18,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 11:30:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:18,893 INFO L225 Difference]: With dead ends: 837 [2019-12-07 11:30:18,893 INFO L226 Difference]: Without dead ends: 472 [2019-12-07 11:30:18,894 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 11:30:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-12-07 11:30:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 412. [2019-12-07 11:30:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-12-07 11:30:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2019-12-07 11:30:18,903 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 143 [2019-12-07 11:30:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:18,903 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2019-12-07 11:30:18,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2019-12-07 11:30:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 11:30:18,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:18,904 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:18,904 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash 654076365, now seen corresponding path program 1 times [2019-12-07 11:30:18,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:18,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969872742] [2019-12-07 11:30:18,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:18,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969872742] [2019-12-07 11:30:18,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:18,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:18,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71882251] [2019-12-07 11:30:18,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:18,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:18,945 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:19,193 INFO L93 Difference]: Finished difference Result 857 states and 1308 transitions. [2019-12-07 11:30:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:19,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-12-07 11:30:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:19,195 INFO L225 Difference]: With dead ends: 857 [2019-12-07 11:30:19,195 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 11:30:19,195 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 11:30:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 11:30:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2019-12-07 11:30:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 11:30:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 628 transitions. [2019-12-07 11:30:19,205 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 628 transitions. Word has length 144 [2019-12-07 11:30:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:19,205 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 628 transitions. [2019-12-07 11:30:19,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 628 transitions. [2019-12-07 11:30:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 11:30:19,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:19,206 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:19,206 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1369491918, now seen corresponding path program 1 times [2019-12-07 11:30:19,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:19,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712412963] [2019-12-07 11:30:19,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 11:30:19,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712412963] [2019-12-07 11:30:19,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:19,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:19,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379222438] [2019-12-07 11:30:19,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:19,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:19,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:19,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:19,245 INFO L87 Difference]: Start difference. First operand 413 states and 628 transitions. Second operand 4 states. [2019-12-07 11:30:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:19,505 INFO L93 Difference]: Finished difference Result 858 states and 1308 transitions. [2019-12-07 11:30:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:19,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 11:30:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:19,508 INFO L225 Difference]: With dead ends: 858 [2019-12-07 11:30:19,508 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 11:30:19,508 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 11:30:19,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 11:30:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2019-12-07 11:30:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 11:30:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 627 transitions. [2019-12-07 11:30:19,518 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 627 transitions. Word has length 146 [2019-12-07 11:30:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:19,518 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 627 transitions. [2019-12-07 11:30:19,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 627 transitions. [2019-12-07 11:30:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 11:30:19,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:19,519 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:19,519 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:19,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:19,519 INFO L82 PathProgramCache]: Analyzing trace with hash -104548165, now seen corresponding path program 1 times [2019-12-07 11:30:19,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:19,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558267774] [2019-12-07 11:30:19,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 11:30:19,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558267774] [2019-12-07 11:30:19,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:19,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:19,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075609176] [2019-12-07 11:30:19,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:19,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:19,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:19,561 INFO L87 Difference]: Start difference. First operand 413 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:19,806 INFO L93 Difference]: Finished difference Result 856 states and 1304 transitions. [2019-12-07 11:30:19,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:19,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 11:30:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:19,808 INFO L225 Difference]: With dead ends: 856 [2019-12-07 11:30:19,808 INFO L226 Difference]: Without dead ends: 462 [2019-12-07 11:30:19,808 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 11:30:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-07 11:30:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2019-12-07 11:30:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 11:30:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 626 transitions. [2019-12-07 11:30:19,818 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 626 transitions. Word has length 147 [2019-12-07 11:30:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:19,818 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 626 transitions. [2019-12-07 11:30:19,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 626 transitions. [2019-12-07 11:30:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 11:30:19,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:19,819 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:19,819 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash -614168594, now seen corresponding path program 1 times [2019-12-07 11:30:19,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:19,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945837413] [2019-12-07 11:30:19,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:19,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945837413] [2019-12-07 11:30:19,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:19,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:19,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941671907] [2019-12-07 11:30:19,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:19,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:19,862 INFO L87 Difference]: Start difference. First operand 413 states and 626 transitions. Second operand 4 states. [2019-12-07 11:30:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:20,104 INFO L93 Difference]: Finished difference Result 853 states and 1298 transitions. [2019-12-07 11:30:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:20,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 11:30:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:20,107 INFO L225 Difference]: With dead ends: 853 [2019-12-07 11:30:20,107 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 11:30:20,107 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 11:30:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 11:30:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 416. [2019-12-07 11:30:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 11:30:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2019-12-07 11:30:20,119 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 147 [2019-12-07 11:30:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:20,119 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2019-12-07 11:30:20,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2019-12-07 11:30:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 11:30:20,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:20,120 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:20,120 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1065566135, now seen corresponding path program 1 times [2019-12-07 11:30:20,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:20,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172816548] [2019-12-07 11:30:20,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:30:20,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172816548] [2019-12-07 11:30:20,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:20,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:20,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110006804] [2019-12-07 11:30:20,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:20,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:20,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:20,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:20,162 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2019-12-07 11:30:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:20,406 INFO L93 Difference]: Finished difference Result 847 states and 1286 transitions. [2019-12-07 11:30:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:20,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 11:30:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:20,408 INFO L225 Difference]: With dead ends: 847 [2019-12-07 11:30:20,408 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 11:30:20,408 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 11:30:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 11:30:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-12-07 11:30:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 11:30:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 630 transitions. [2019-12-07 11:30:20,418 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 630 transitions. Word has length 147 [2019-12-07 11:30:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:20,418 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 630 transitions. [2019-12-07 11:30:20,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 630 transitions. [2019-12-07 11:30:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 11:30:20,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:20,419 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, 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] [2019-12-07 11:30:20,419 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash 34276127, now seen corresponding path program 1 times [2019-12-07 11:30:20,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:20,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210043412] [2019-12-07 11:30:20,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:20,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210043412] [2019-12-07 11:30:20,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:20,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:20,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324363287] [2019-12-07 11:30:20,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:20,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:20,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:20,472 INFO L87 Difference]: Start difference. First operand 416 states and 630 transitions. Second operand 4 states. [2019-12-07 11:30:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:20,787 INFO L93 Difference]: Finished difference Result 869 states and 1319 transitions. [2019-12-07 11:30:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:20,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 11:30:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:20,789 INFO L225 Difference]: With dead ends: 869 [2019-12-07 11:30:20,789 INFO L226 Difference]: Without dead ends: 472 [2019-12-07 11:30:20,790 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 11:30:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-12-07 11:30:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 416. [2019-12-07 11:30:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 11:30:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 629 transitions. [2019-12-07 11:30:20,804 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 629 transitions. Word has length 148 [2019-12-07 11:30:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:20,804 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 629 transitions. [2019-12-07 11:30:20,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 629 transitions. [2019-12-07 11:30:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 11:30:20,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:20,805 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:20,805 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash -332834818, now seen corresponding path program 1 times [2019-12-07 11:30:20,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:20,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607282501] [2019-12-07 11:30:20,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:30:20,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607282501] [2019-12-07 11:30:20,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:20,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:20,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820376776] [2019-12-07 11:30:20,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:20,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:20,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:20,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:20,848 INFO L87 Difference]: Start difference. First operand 416 states and 629 transitions. Second operand 4 states. [2019-12-07 11:30:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:21,108 INFO L93 Difference]: Finished difference Result 847 states and 1282 transitions. [2019-12-07 11:30:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:21,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 11:30:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:21,110 INFO L225 Difference]: With dead ends: 847 [2019-12-07 11:30:21,110 INFO L226 Difference]: Without dead ends: 450 [2019-12-07 11:30:21,111 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 11:30:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-12-07 11:30:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-12-07 11:30:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 11:30:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 628 transitions. [2019-12-07 11:30:21,123 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 628 transitions. Word has length 148 [2019-12-07 11:30:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:21,123 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 628 transitions. [2019-12-07 11:30:21,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 628 transitions. [2019-12-07 11:30:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 11:30:21,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:21,124 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, 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] [2019-12-07 11:30:21,124 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 467666756, now seen corresponding path program 1 times [2019-12-07 11:30:21,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:21,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013249731] [2019-12-07 11:30:21,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:21,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013249731] [2019-12-07 11:30:21,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:21,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:21,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107888342] [2019-12-07 11:30:21,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:21,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:21,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:21,172 INFO L87 Difference]: Start difference. First operand 416 states and 628 transitions. Second operand 4 states. [2019-12-07 11:30:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:21,465 INFO L93 Difference]: Finished difference Result 861 states and 1302 transitions. [2019-12-07 11:30:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:21,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 11:30:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:21,466 INFO L225 Difference]: With dead ends: 861 [2019-12-07 11:30:21,466 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 11:30:21,467 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 11:30:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 11:30:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 416. [2019-12-07 11:30:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-07 11:30:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 627 transitions. [2019-12-07 11:30:21,477 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 627 transitions. Word has length 149 [2019-12-07 11:30:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:21,477 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 627 transitions. [2019-12-07 11:30:21,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 627 transitions. [2019-12-07 11:30:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 11:30:21,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:21,478 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:21,478 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:21,479 INFO L82 PathProgramCache]: Analyzing trace with hash -456214673, now seen corresponding path program 1 times [2019-12-07 11:30:21,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:21,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042180304] [2019-12-07 11:30:21,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:21,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042180304] [2019-12-07 11:30:21,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:21,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:21,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704744807] [2019-12-07 11:30:21,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:21,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:21,521 INFO L87 Difference]: Start difference. First operand 416 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:21,780 INFO L93 Difference]: Finished difference Result 856 states and 1294 transitions. [2019-12-07 11:30:21,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:21,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 11:30:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:21,782 INFO L225 Difference]: With dead ends: 856 [2019-12-07 11:30:21,782 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 11:30:21,782 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 11:30:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 11:30:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-12-07 11:30:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 11:30:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 628 transitions. [2019-12-07 11:30:21,798 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 628 transitions. Word has length 149 [2019-12-07 11:30:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:21,799 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 628 transitions. [2019-12-07 11:30:21,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 628 transitions. [2019-12-07 11:30:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 11:30:21,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:21,800 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:21,800 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:21,800 INFO L82 PathProgramCache]: Analyzing trace with hash -180653582, now seen corresponding path program 1 times [2019-12-07 11:30:21,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:21,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658049789] [2019-12-07 11:30:21,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:30:21,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658049789] [2019-12-07 11:30:21,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:21,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:21,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295846394] [2019-12-07 11:30:21,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:21,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:21,841 INFO L87 Difference]: Start difference. First operand 417 states and 628 transitions. Second operand 4 states. [2019-12-07 11:30:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:22,097 INFO L93 Difference]: Finished difference Result 849 states and 1280 transitions. [2019-12-07 11:30:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:22,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 11:30:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:22,098 INFO L225 Difference]: With dead ends: 849 [2019-12-07 11:30:22,098 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 11:30:22,099 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 11:30:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 11:30:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2019-12-07 11:30:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 11:30:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 627 transitions. [2019-12-07 11:30:22,111 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 627 transitions. Word has length 149 [2019-12-07 11:30:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:22,111 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 627 transitions. [2019-12-07 11:30:22,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 627 transitions. [2019-12-07 11:30:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 11:30:22,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:22,112 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:22,112 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:22,112 INFO L82 PathProgramCache]: Analyzing trace with hash 247505163, now seen corresponding path program 1 times [2019-12-07 11:30:22,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:22,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650651821] [2019-12-07 11:30:22,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:22,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650651821] [2019-12-07 11:30:22,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:22,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:22,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971529098] [2019-12-07 11:30:22,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:22,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:22,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:22,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:22,156 INFO L87 Difference]: Start difference. First operand 417 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:22,413 INFO L93 Difference]: Finished difference Result 853 states and 1287 transitions. [2019-12-07 11:30:22,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:22,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 11:30:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:22,414 INFO L225 Difference]: With dead ends: 853 [2019-12-07 11:30:22,414 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 11:30:22,415 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 11:30:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 11:30:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 418. [2019-12-07 11:30:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-12-07 11:30:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 628 transitions. [2019-12-07 11:30:22,428 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 628 transitions. Word has length 150 [2019-12-07 11:30:22,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:22,428 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 628 transitions. [2019-12-07 11:30:22,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 628 transitions. [2019-12-07 11:30:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 11:30:22,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:22,429 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:22,430 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:22,430 INFO L82 PathProgramCache]: Analyzing trace with hash 768864125, now seen corresponding path program 1 times [2019-12-07 11:30:22,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:22,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074457183] [2019-12-07 11:30:22,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:22,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074457183] [2019-12-07 11:30:22,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:22,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:22,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517001461] [2019-12-07 11:30:22,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:22,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:22,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:22,481 INFO L87 Difference]: Start difference. First operand 418 states and 628 transitions. Second operand 4 states. [2019-12-07 11:30:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:22,752 INFO L93 Difference]: Finished difference Result 854 states and 1287 transitions. [2019-12-07 11:30:22,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:22,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 11:30:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:22,754 INFO L225 Difference]: With dead ends: 854 [2019-12-07 11:30:22,754 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 11:30:22,754 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 11:30:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 11:30:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 419. [2019-12-07 11:30:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 11:30:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 629 transitions. [2019-12-07 11:30:22,767 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 629 transitions. Word has length 150 [2019-12-07 11:30:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:22,767 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 629 transitions. [2019-12-07 11:30:22,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 629 transitions. [2019-12-07 11:30:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 11:30:22,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:22,768 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:22,768 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:22,768 INFO L82 PathProgramCache]: Analyzing trace with hash 794935257, now seen corresponding path program 1 times [2019-12-07 11:30:22,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:22,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623324634] [2019-12-07 11:30:22,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 11:30:22,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623324634] [2019-12-07 11:30:22,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:22,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:22,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660889661] [2019-12-07 11:30:22,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:22,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:22,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:22,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:22,807 INFO L87 Difference]: Start difference. First operand 419 states and 629 transitions. Second operand 4 states. [2019-12-07 11:30:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:23,059 INFO L93 Difference]: Finished difference Result 843 states and 1270 transitions. [2019-12-07 11:30:23,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:23,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 11:30:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:23,060 INFO L225 Difference]: With dead ends: 843 [2019-12-07 11:30:23,060 INFO L226 Difference]: Without dead ends: 443 [2019-12-07 11:30:23,061 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 11:30:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-12-07 11:30:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 419. [2019-12-07 11:30:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 11:30:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 628 transitions. [2019-12-07 11:30:23,073 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 628 transitions. Word has length 150 [2019-12-07 11:30:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:23,073 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 628 transitions. [2019-12-07 11:30:23,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 628 transitions. [2019-12-07 11:30:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 11:30:23,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:23,074 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:23,074 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:23,074 INFO L82 PathProgramCache]: Analyzing trace with hash -120499735, now seen corresponding path program 1 times [2019-12-07 11:30:23,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:23,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936640322] [2019-12-07 11:30:23,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 11:30:23,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936640322] [2019-12-07 11:30:23,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:23,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:23,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756297122] [2019-12-07 11:30:23,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:23,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:23,114 INFO L87 Difference]: Start difference. First operand 419 states and 628 transitions. Second operand 4 states. [2019-12-07 11:30:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:23,410 INFO L93 Difference]: Finished difference Result 864 states and 1296 transitions. [2019-12-07 11:30:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:23,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 11:30:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:23,411 INFO L225 Difference]: With dead ends: 864 [2019-12-07 11:30:23,411 INFO L226 Difference]: Without dead ends: 464 [2019-12-07 11:30:23,412 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 11:30:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-07 11:30:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2019-12-07 11:30:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-07 11:30:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 627 transitions. [2019-12-07 11:30:23,423 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 627 transitions. Word has length 151 [2019-12-07 11:30:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:23,423 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 627 transitions. [2019-12-07 11:30:23,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 627 transitions. [2019-12-07 11:30:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 11:30:23,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:23,424 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:23,424 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash -513774399, now seen corresponding path program 1 times [2019-12-07 11:30:23,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:23,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620091967] [2019-12-07 11:30:23,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:23,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620091967] [2019-12-07 11:30:23,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:23,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:23,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710061499] [2019-12-07 11:30:23,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:23,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:23,466 INFO L87 Difference]: Start difference. First operand 419 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:23,718 INFO L93 Difference]: Finished difference Result 853 states and 1281 transitions. [2019-12-07 11:30:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:23,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 11:30:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:23,719 INFO L225 Difference]: With dead ends: 853 [2019-12-07 11:30:23,719 INFO L226 Difference]: Without dead ends: 453 [2019-12-07 11:30:23,720 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 11:30:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-12-07 11:30:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 420. [2019-12-07 11:30:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-07 11:30:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 628 transitions. [2019-12-07 11:30:23,732 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 628 transitions. Word has length 151 [2019-12-07 11:30:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:23,733 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 628 transitions. [2019-12-07 11:30:23,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 628 transitions. [2019-12-07 11:30:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 11:30:23,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:23,733 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:23,734 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:23,734 INFO L82 PathProgramCache]: Analyzing trace with hash -40496156, now seen corresponding path program 1 times [2019-12-07 11:30:23,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:23,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947948124] [2019-12-07 11:30:23,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 11:30:23,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947948124] [2019-12-07 11:30:23,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:23,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:23,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532804974] [2019-12-07 11:30:23,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:23,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:23,774 INFO L87 Difference]: Start difference. First operand 420 states and 628 transitions. Second operand 4 states. [2019-12-07 11:30:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:24,054 INFO L93 Difference]: Finished difference Result 863 states and 1292 transitions. [2019-12-07 11:30:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:24,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 11:30:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:24,055 INFO L225 Difference]: With dead ends: 863 [2019-12-07 11:30:24,055 INFO L226 Difference]: Without dead ends: 462 [2019-12-07 11:30:24,056 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 11:30:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-07 11:30:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 420. [2019-12-07 11:30:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-07 11:30:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 627 transitions. [2019-12-07 11:30:24,068 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 627 transitions. Word has length 152 [2019-12-07 11:30:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:24,068 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 627 transitions. [2019-12-07 11:30:24,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 627 transitions. [2019-12-07 11:30:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 11:30:24,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:24,069 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, 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 11:30:24,069 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -550116585, now seen corresponding path program 1 times [2019-12-07 11:30:24,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:24,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863838605] [2019-12-07 11:30:24,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:24,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863838605] [2019-12-07 11:30:24,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:24,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:24,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803138731] [2019-12-07 11:30:24,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:24,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:24,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:24,111 INFO L87 Difference]: Start difference. First operand 420 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:24,370 INFO L93 Difference]: Finished difference Result 860 states and 1286 transitions. [2019-12-07 11:30:24,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:24,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 11:30:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:24,371 INFO L225 Difference]: With dead ends: 860 [2019-12-07 11:30:24,371 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 11:30:24,371 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 11:30:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 11:30:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 420. [2019-12-07 11:30:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-07 11:30:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 626 transitions. [2019-12-07 11:30:24,384 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 626 transitions. Word has length 152 [2019-12-07 11:30:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:24,384 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 626 transitions. [2019-12-07 11:30:24,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 626 transitions. [2019-12-07 11:30:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 11:30:24,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:24,385 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:24,385 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:24,385 INFO L82 PathProgramCache]: Analyzing trace with hash -24091464, now seen corresponding path program 1 times [2019-12-07 11:30:24,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:24,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189626222] [2019-12-07 11:30:24,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:24,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189626222] [2019-12-07 11:30:24,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:24,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:24,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503642025] [2019-12-07 11:30:24,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:24,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:24,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:24,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:24,429 INFO L87 Difference]: Start difference. First operand 420 states and 626 transitions. Second operand 4 states. [2019-12-07 11:30:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:24,688 INFO L93 Difference]: Finished difference Result 854 states and 1277 transitions. [2019-12-07 11:30:24,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:24,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 11:30:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:24,689 INFO L225 Difference]: With dead ends: 854 [2019-12-07 11:30:24,689 INFO L226 Difference]: Without dead ends: 453 [2019-12-07 11:30:24,690 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 11:30:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-12-07 11:30:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 421. [2019-12-07 11:30:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-07 11:30:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 627 transitions. [2019-12-07 11:30:24,702 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 627 transitions. Word has length 152 [2019-12-07 11:30:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:24,702 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 627 transitions. [2019-12-07 11:30:24,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2019-12-07 11:30:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 11:30:24,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:24,703 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:24,703 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:24,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1607216036, now seen corresponding path program 1 times [2019-12-07 11:30:24,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:24,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336984753] [2019-12-07 11:30:24,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:24,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336984753] [2019-12-07 11:30:24,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:24,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:24,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655975775] [2019-12-07 11:30:24,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:24,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:24,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:24,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:24,748 INFO L87 Difference]: Start difference. First operand 421 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:25,175 INFO L93 Difference]: Finished difference Result 853 states and 1275 transitions. [2019-12-07 11:30:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:25,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 11:30:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:25,176 INFO L225 Difference]: With dead ends: 853 [2019-12-07 11:30:25,176 INFO L226 Difference]: Without dead ends: 451 [2019-12-07 11:30:25,177 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 11:30:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-07 11:30:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2019-12-07 11:30:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-07 11:30:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 628 transitions. [2019-12-07 11:30:25,195 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 628 transitions. Word has length 153 [2019-12-07 11:30:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:25,196 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 628 transitions. [2019-12-07 11:30:25,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 628 transitions. [2019-12-07 11:30:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 11:30:25,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:25,197 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:25,197 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:25,197 INFO L82 PathProgramCache]: Analyzing trace with hash 968223832, now seen corresponding path program 1 times [2019-12-07 11:30:25,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:25,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065735470] [2019-12-07 11:30:25,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:25,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065735470] [2019-12-07 11:30:25,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:25,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:25,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116180509] [2019-12-07 11:30:25,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:25,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:25,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:25,244 INFO L87 Difference]: Start difference. First operand 422 states and 628 transitions. Second operand 4 states. [2019-12-07 11:30:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:25,490 INFO L93 Difference]: Finished difference Result 862 states and 1284 transitions. [2019-12-07 11:30:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:25,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 11:30:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:25,491 INFO L225 Difference]: With dead ends: 862 [2019-12-07 11:30:25,491 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 11:30:25,492 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 11:30:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 11:30:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 422. [2019-12-07 11:30:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-07 11:30:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 627 transitions. [2019-12-07 11:30:25,503 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 627 transitions. Word has length 154 [2019-12-07 11:30:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:25,504 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 627 transitions. [2019-12-07 11:30:25,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 627 transitions. [2019-12-07 11:30:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 11:30:25,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:25,505 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:25,505 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:25,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1455425858, now seen corresponding path program 1 times [2019-12-07 11:30:25,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:25,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740092468] [2019-12-07 11:30:25,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:25,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740092468] [2019-12-07 11:30:25,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:25,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:25,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384523700] [2019-12-07 11:30:25,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:25,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:25,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:25,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:25,548 INFO L87 Difference]: Start difference. First operand 422 states and 627 transitions. Second operand 4 states. [2019-12-07 11:30:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:25,816 INFO L93 Difference]: Finished difference Result 858 states and 1277 transitions. [2019-12-07 11:30:25,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:25,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 11:30:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:25,818 INFO L225 Difference]: With dead ends: 858 [2019-12-07 11:30:25,818 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 11:30:25,818 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 11:30:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 11:30:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2019-12-07 11:30:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-07 11:30:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 626 transitions. [2019-12-07 11:30:25,831 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 626 transitions. Word has length 155 [2019-12-07 11:30:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:25,831 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 626 transitions. [2019-12-07 11:30:25,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 626 transitions. [2019-12-07 11:30:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 11:30:25,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:25,832 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:25,832 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1976784820, now seen corresponding path program 1 times [2019-12-07 11:30:25,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:25,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342148948] [2019-12-07 11:30:25,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:25,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342148948] [2019-12-07 11:30:25,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:25,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:25,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601161757] [2019-12-07 11:30:25,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:25,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:25,884 INFO L87 Difference]: Start difference. First operand 422 states and 626 transitions. Second operand 4 states. [2019-12-07 11:30:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:26,155 INFO L93 Difference]: Finished difference Result 858 states and 1275 transitions. [2019-12-07 11:30:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:26,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 11:30:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:26,156 INFO L225 Difference]: With dead ends: 858 [2019-12-07 11:30:26,157 INFO L226 Difference]: Without dead ends: 455 [2019-12-07 11:30:26,157 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 11:30:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-07 11:30:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2019-12-07 11:30:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-07 11:30:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 625 transitions. [2019-12-07 11:30:26,172 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 625 transitions. Word has length 155 [2019-12-07 11:30:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:26,172 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 625 transitions. [2019-12-07 11:30:26,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2019-12-07 11:30:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 11:30:26,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:26,173 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:26,174 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1722938518, now seen corresponding path program 1 times [2019-12-07 11:30:26,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:26,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382788649] [2019-12-07 11:30:26,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:26,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382788649] [2019-12-07 11:30:26,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:26,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:26,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176596307] [2019-12-07 11:30:26,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:26,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:26,218 INFO L87 Difference]: Start difference. First operand 422 states and 625 transitions. Second operand 4 states. [2019-12-07 11:30:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:26,540 INFO L93 Difference]: Finished difference Result 856 states and 1271 transitions. [2019-12-07 11:30:26,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:26,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 11:30:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:26,541 INFO L225 Difference]: With dead ends: 856 [2019-12-07 11:30:26,541 INFO L226 Difference]: Without dead ends: 453 [2019-12-07 11:30:26,542 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 11:30:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-12-07 11:30:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2019-12-07 11:30:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-07 11:30:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 624 transitions. [2019-12-07 11:30:26,558 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 624 transitions. Word has length 156 [2019-12-07 11:30:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:26,559 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 624 transitions. [2019-12-07 11:30:26,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 624 transitions. [2019-12-07 11:30:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 11:30:26,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:26,560 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:26,560 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1146526511, now seen corresponding path program 1 times [2019-12-07 11:30:26,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:26,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128475060] [2019-12-07 11:30:26,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:26,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128475060] [2019-12-07 11:30:26,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:26,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:26,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051408629] [2019-12-07 11:30:26,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:26,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:26,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:26,609 INFO L87 Difference]: Start difference. First operand 422 states and 624 transitions. Second operand 4 states. [2019-12-07 11:30:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:26,868 INFO L93 Difference]: Finished difference Result 856 states and 1269 transitions. [2019-12-07 11:30:26,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:26,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 11:30:26,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:26,870 INFO L225 Difference]: With dead ends: 856 [2019-12-07 11:30:26,870 INFO L226 Difference]: Without dead ends: 453 [2019-12-07 11:30:26,870 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 11:30:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-12-07 11:30:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2019-12-07 11:30:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-07 11:30:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 623 transitions. [2019-12-07 11:30:26,890 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 623 transitions. Word has length 157 [2019-12-07 11:30:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:26,890 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 623 transitions. [2019-12-07 11:30:26,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 623 transitions. [2019-12-07 11:30:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 11:30:26,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:26,892 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] [2019-12-07 11:30:26,892 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1103781342, now seen corresponding path program 1 times [2019-12-07 11:30:26,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:26,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651094485] [2019-12-07 11:30:26,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:26,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651094485] [2019-12-07 11:30:26,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:26,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:26,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214871835] [2019-12-07 11:30:26,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:26,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:26,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:26,938 INFO L87 Difference]: Start difference. First operand 422 states and 623 transitions. Second operand 4 states. [2019-12-07 11:30:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:27,219 INFO L93 Difference]: Finished difference Result 891 states and 1326 transitions. [2019-12-07 11:30:27,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:27,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 11:30:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:27,220 INFO L225 Difference]: With dead ends: 891 [2019-12-07 11:30:27,220 INFO L226 Difference]: Without dead ends: 488 [2019-12-07 11:30:27,220 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 11:30:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-07 11:30:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2019-12-07 11:30:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-12-07 11:30:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 676 transitions. [2019-12-07 11:30:27,233 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 676 transitions. Word has length 157 [2019-12-07 11:30:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:27,233 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 676 transitions. [2019-12-07 11:30:27,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 676 transitions. [2019-12-07 11:30:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 11:30:27,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:27,234 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:27,234 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash 322202821, now seen corresponding path program 1 times [2019-12-07 11:30:27,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:27,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533250001] [2019-12-07 11:30:27,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:27,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533250001] [2019-12-07 11:30:27,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:27,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:27,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525198457] [2019-12-07 11:30:27,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:27,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:27,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:27,279 INFO L87 Difference]: Start difference. First operand 452 states and 676 transitions. Second operand 4 states. [2019-12-07 11:30:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:27,538 INFO L93 Difference]: Finished difference Result 914 states and 1371 transitions. [2019-12-07 11:30:27,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:27,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 11:30:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:27,539 INFO L225 Difference]: With dead ends: 914 [2019-12-07 11:30:27,539 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 11:30:27,539 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 11:30:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 11:30:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 414. [2019-12-07 11:30:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-07 11:30:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 620 transitions. [2019-12-07 11:30:27,552 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 620 transitions. Word has length 158 [2019-12-07 11:30:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:27,552 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 620 transitions. [2019-12-07 11:30:27,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 620 transitions. [2019-12-07 11:30:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 11:30:27,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:27,553 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:27,553 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash 942215189, now seen corresponding path program 1 times [2019-12-07 11:30:27,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:27,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894108701] [2019-12-07 11:30:27,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 11:30:27,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894108701] [2019-12-07 11:30:27,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:27,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:27,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868249149] [2019-12-07 11:30:27,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:27,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:27,597 INFO L87 Difference]: Start difference. First operand 414 states and 620 transitions. Second operand 4 states. [2019-12-07 11:30:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:27,842 INFO L93 Difference]: Finished difference Result 876 states and 1314 transitions. [2019-12-07 11:30:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:27,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 11:30:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:27,843 INFO L225 Difference]: With dead ends: 876 [2019-12-07 11:30:27,843 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 11:30:27,843 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 11:30:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 11:30:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 444. [2019-12-07 11:30:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-07 11:30:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 665 transitions. [2019-12-07 11:30:27,857 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 665 transitions. Word has length 160 [2019-12-07 11:30:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:27,857 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 665 transitions. [2019-12-07 11:30:27,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 665 transitions. [2019-12-07 11:30:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 11:30:27,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:27,858 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:27,858 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1441958602, now seen corresponding path program 1 times [2019-12-07 11:30:27,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:27,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822915450] [2019-12-07 11:30:27,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 11:30:27,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822915450] [2019-12-07 11:30:27,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:27,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:27,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890266540] [2019-12-07 11:30:27,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:27,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:27,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:27,900 INFO L87 Difference]: Start difference. First operand 444 states and 665 transitions. Second operand 4 states. [2019-12-07 11:30:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:28,150 INFO L93 Difference]: Finished difference Result 893 states and 1342 transitions. [2019-12-07 11:30:28,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:28,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 11:30:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:28,151 INFO L225 Difference]: With dead ends: 893 [2019-12-07 11:30:28,151 INFO L226 Difference]: Without dead ends: 468 [2019-12-07 11:30:28,151 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 11:30:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-12-07 11:30:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 444. [2019-12-07 11:30:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-07 11:30:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 664 transitions. [2019-12-07 11:30:28,166 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 664 transitions. Word has length 160 [2019-12-07 11:30:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:28,166 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 664 transitions. [2019-12-07 11:30:28,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 664 transitions. [2019-12-07 11:30:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 11:30:28,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:28,167 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:28,167 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:28,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:28,167 INFO L82 PathProgramCache]: Analyzing trace with hash 639470398, now seen corresponding path program 1 times [2019-12-07 11:30:28,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:28,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915182493] [2019-12-07 11:30:28,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 11:30:28,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915182493] [2019-12-07 11:30:28,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:28,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:28,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992693533] [2019-12-07 11:30:28,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:28,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:28,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:28,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:28,211 INFO L87 Difference]: Start difference. First operand 444 states and 664 transitions. Second operand 4 states. [2019-12-07 11:30:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:28,454 INFO L93 Difference]: Finished difference Result 904 states and 1354 transitions. [2019-12-07 11:30:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:28,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 11:30:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:28,455 INFO L225 Difference]: With dead ends: 904 [2019-12-07 11:30:28,455 INFO L226 Difference]: Without dead ends: 479 [2019-12-07 11:30:28,456 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 11:30:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-07 11:30:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 445. [2019-12-07 11:30:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-07 11:30:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 665 transitions. [2019-12-07 11:30:28,470 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 665 transitions. Word has length 161 [2019-12-07 11:30:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:28,470 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 665 transitions. [2019-12-07 11:30:28,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 665 transitions. [2019-12-07 11:30:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 11:30:28,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:28,470 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:28,471 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 9508236, now seen corresponding path program 1 times [2019-12-07 11:30:28,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:28,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178721890] [2019-12-07 11:30:28,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-12-07 11:30:28,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178721890] [2019-12-07 11:30:28,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:28,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:28,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472788008] [2019-12-07 11:30:28,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:28,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:28,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:28,516 INFO L87 Difference]: Start difference. First operand 445 states and 665 transitions. Second operand 3 states. [2019-12-07 11:30:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:28,572 INFO L93 Difference]: Finished difference Result 1293 states and 1946 transitions. [2019-12-07 11:30:28,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:28,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-12-07 11:30:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:28,573 INFO L225 Difference]: With dead ends: 1293 [2019-12-07 11:30:28,573 INFO L226 Difference]: Without dead ends: 867 [2019-12-07 11:30:28,573 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 11:30:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-12-07 11:30:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2019-12-07 11:30:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-12-07 11:30:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1292 transitions. [2019-12-07 11:30:28,604 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1292 transitions. Word has length 161 [2019-12-07 11:30:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:28,604 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1292 transitions. [2019-12-07 11:30:28,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1292 transitions. [2019-12-07 11:30:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 11:30:28,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:28,605 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:28,605 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1151072035, now seen corresponding path program 1 times [2019-12-07 11:30:28,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:28,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720872055] [2019-12-07 11:30:28,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 11:30:28,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720872055] [2019-12-07 11:30:28,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:28,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:28,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651046855] [2019-12-07 11:30:28,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:28,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:28,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:28,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:28,647 INFO L87 Difference]: Start difference. First operand 865 states and 1292 transitions. Second operand 4 states. [2019-12-07 11:30:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:28,931 INFO L93 Difference]: Finished difference Result 1755 states and 2626 transitions. [2019-12-07 11:30:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:28,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 11:30:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:28,932 INFO L225 Difference]: With dead ends: 1755 [2019-12-07 11:30:28,932 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 11:30:28,933 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 11:30:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 11:30:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 865. [2019-12-07 11:30:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-12-07 11:30:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1290 transitions. [2019-12-07 11:30:28,959 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1290 transitions. Word has length 161 [2019-12-07 11:30:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:28,960 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1290 transitions. [2019-12-07 11:30:28,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1290 transitions. [2019-12-07 11:30:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 11:30:28,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:28,961 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] [2019-12-07 11:30:28,961 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash -712421640, now seen corresponding path program 1 times [2019-12-07 11:30:28,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:28,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196390281] [2019-12-07 11:30:28,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:29,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196390281] [2019-12-07 11:30:29,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:29,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:30:29,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502637910] [2019-12-07 11:30:29,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:29,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:29,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:29,037 INFO L87 Difference]: Start difference. First operand 865 states and 1290 transitions. Second operand 5 states. [2019-12-07 11:30:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:29,481 INFO L93 Difference]: Finished difference Result 1863 states and 2792 transitions. [2019-12-07 11:30:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:30:29,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-12-07 11:30:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:29,482 INFO L225 Difference]: With dead ends: 1863 [2019-12-07 11:30:29,482 INFO L226 Difference]: Without dead ends: 1017 [2019-12-07 11:30:29,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:30:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-12-07 11:30:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 931. [2019-12-07 11:30:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-07 11:30:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1408 transitions. [2019-12-07 11:30:29,511 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1408 transitions. Word has length 162 [2019-12-07 11:30:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:29,511 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1408 transitions. [2019-12-07 11:30:29,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1408 transitions. [2019-12-07 11:30:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 11:30:29,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:29,512 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:29,512 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1482730618, now seen corresponding path program 1 times [2019-12-07 11:30:29,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:29,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031794868] [2019-12-07 11:30:29,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:29,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031794868] [2019-12-07 11:30:29,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:29,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:29,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259013673] [2019-12-07 11:30:29,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:29,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:29,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:29,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:29,573 INFO L87 Difference]: Start difference. First operand 931 states and 1408 transitions. Second operand 4 states. [2019-12-07 11:30:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:29,844 INFO L93 Difference]: Finished difference Result 1911 states and 2882 transitions. [2019-12-07 11:30:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:29,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-12-07 11:30:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:29,845 INFO L225 Difference]: With dead ends: 1911 [2019-12-07 11:30:29,845 INFO L226 Difference]: Without dead ends: 999 [2019-12-07 11:30:29,845 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 11:30:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-12-07 11:30:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 955. [2019-12-07 11:30:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-12-07 11:30:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1436 transitions. [2019-12-07 11:30:29,873 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1436 transitions. Word has length 164 [2019-12-07 11:30:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:29,873 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 1436 transitions. [2019-12-07 11:30:29,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1436 transitions. [2019-12-07 11:30:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 11:30:29,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:29,874 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:29,874 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1289166964, now seen corresponding path program 1 times [2019-12-07 11:30:29,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:29,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290521424] [2019-12-07 11:30:29,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 11:30:29,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290521424] [2019-12-07 11:30:29,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:29,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:29,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692339630] [2019-12-07 11:30:29,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:29,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:29,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:29,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:29,940 INFO L87 Difference]: Start difference. First operand 955 states and 1436 transitions. Second operand 4 states. [2019-12-07 11:30:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:30,208 INFO L93 Difference]: Finished difference Result 1945 states and 2924 transitions. [2019-12-07 11:30:30,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:30,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-12-07 11:30:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:30,209 INFO L225 Difference]: With dead ends: 1945 [2019-12-07 11:30:30,209 INFO L226 Difference]: Without dead ends: 1009 [2019-12-07 11:30:30,209 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 11:30:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-12-07 11:30:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 955. [2019-12-07 11:30:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-12-07 11:30:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1434 transitions. [2019-12-07 11:30:30,237 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1434 transitions. Word has length 165 [2019-12-07 11:30:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:30,237 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 1434 transitions. [2019-12-07 11:30:30,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1434 transitions. [2019-12-07 11:30:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 11:30:30,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:30,238 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:30,238 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash 156450878, now seen corresponding path program 1 times [2019-12-07 11:30:30,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:30,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202956555] [2019-12-07 11:30:30,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 11:30:30,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202956555] [2019-12-07 11:30:30,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:30,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:30,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313637798] [2019-12-07 11:30:30,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:30,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:30,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:30,289 INFO L87 Difference]: Start difference. First operand 955 states and 1434 transitions. Second operand 4 states. [2019-12-07 11:30:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:30,569 INFO L93 Difference]: Finished difference Result 1923 states and 2888 transitions. [2019-12-07 11:30:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:30,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-12-07 11:30:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:30,570 INFO L225 Difference]: With dead ends: 1923 [2019-12-07 11:30:30,570 INFO L226 Difference]: Without dead ends: 983 [2019-12-07 11:30:30,570 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 11:30:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-12-07 11:30:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 953. [2019-12-07 11:30:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-07 11:30:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1430 transitions. [2019-12-07 11:30:30,598 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1430 transitions. Word has length 165 [2019-12-07 11:30:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:30,599 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1430 transitions. [2019-12-07 11:30:30,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1430 transitions. [2019-12-07 11:30:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 11:30:30,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:30,599 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:30,600 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 186100391, now seen corresponding path program 1 times [2019-12-07 11:30:30,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:30,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767869141] [2019-12-07 11:30:30,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 11:30:30,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767869141] [2019-12-07 11:30:30,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:30,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:30,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790541008] [2019-12-07 11:30:30,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:30,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:30,647 INFO L87 Difference]: Start difference. First operand 953 states and 1430 transitions. Second operand 4 states. [2019-12-07 11:30:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:30,943 INFO L93 Difference]: Finished difference Result 1937 states and 2908 transitions. [2019-12-07 11:30:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:30,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-12-07 11:30:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:30,945 INFO L225 Difference]: With dead ends: 1937 [2019-12-07 11:30:30,945 INFO L226 Difference]: Without dead ends: 1003 [2019-12-07 11:30:30,945 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 11:30:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-12-07 11:30:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 953. [2019-12-07 11:30:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-07 11:30:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1428 transitions. [2019-12-07 11:30:30,980 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1428 transitions. Word has length 166 [2019-12-07 11:30:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:30,980 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1428 transitions. [2019-12-07 11:30:30,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1428 transitions. [2019-12-07 11:30:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 11:30:30,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:30,981 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, 1, 1] [2019-12-07 11:30:30,981 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash -443861771, now seen corresponding path program 1 times [2019-12-07 11:30:30,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:30,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041479543] [2019-12-07 11:30:30,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 11:30:31,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041479543] [2019-12-07 11:30:31,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:31,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:31,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087630077] [2019-12-07 11:30:31,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:31,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:31,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:31,027 INFO L87 Difference]: Start difference. First operand 953 states and 1428 transitions. Second operand 3 states. [2019-12-07 11:30:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:31,123 INFO L93 Difference]: Finished difference Result 2349 states and 3535 transitions. [2019-12-07 11:30:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:31,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 11:30:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:31,125 INFO L225 Difference]: With dead ends: 2349 [2019-12-07 11:30:31,125 INFO L226 Difference]: Without dead ends: 1415 [2019-12-07 11:30:31,125 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 11:30:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-12-07 11:30:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1415. [2019-12-07 11:30:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-07 11:30:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2118 transitions. [2019-12-07 11:30:31,179 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2118 transitions. Word has length 166 [2019-12-07 11:30:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:31,179 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 2118 transitions. [2019-12-07 11:30:31,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2118 transitions. [2019-12-07 11:30:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 11:30:31,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:31,180 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, 1, 1, 1] [2019-12-07 11:30:31,180 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -317547734, now seen corresponding path program 1 times [2019-12-07 11:30:31,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:31,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440069311] [2019-12-07 11:30:31,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:30:31,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440069311] [2019-12-07 11:30:31,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:31,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:31,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947789816] [2019-12-07 11:30:31,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:31,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:31,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:31,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:31,217 INFO L87 Difference]: Start difference. First operand 1415 states and 2118 transitions. Second operand 3 states. [2019-12-07 11:30:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:31,319 INFO L93 Difference]: Finished difference Result 3271 states and 4910 transitions. [2019-12-07 11:30:31,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:31,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 11:30:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:31,320 INFO L225 Difference]: With dead ends: 3271 [2019-12-07 11:30:31,320 INFO L226 Difference]: Without dead ends: 1875 [2019-12-07 11:30:31,321 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 11:30:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-12-07 11:30:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1869. [2019-12-07 11:30:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2019-12-07 11:30:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2799 transitions. [2019-12-07 11:30:31,378 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2799 transitions. Word has length 167 [2019-12-07 11:30:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:31,379 INFO L462 AbstractCegarLoop]: Abstraction has 1869 states and 2799 transitions. [2019-12-07 11:30:31,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2799 transitions. [2019-12-07 11:30:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 11:30:31,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:31,380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:31,380 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1811150326, now seen corresponding path program 1 times [2019-12-07 11:30:31,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:31,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805051702] [2019-12-07 11:30:31,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 11:30:31,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805051702] [2019-12-07 11:30:31,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:31,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:31,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170840723] [2019-12-07 11:30:31,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:31,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:31,423 INFO L87 Difference]: Start difference. First operand 1869 states and 2799 transitions. Second operand 3 states. [2019-12-07 11:30:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:31,543 INFO L93 Difference]: Finished difference Result 4140 states and 6212 transitions. [2019-12-07 11:30:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:31,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 11:30:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:31,545 INFO L225 Difference]: With dead ends: 4140 [2019-12-07 11:30:31,545 INFO L226 Difference]: Without dead ends: 2290 [2019-12-07 11:30:31,546 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 11:30:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-12-07 11:30:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2284. [2019-12-07 11:30:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2019-12-07 11:30:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3427 transitions. [2019-12-07 11:30:31,616 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3427 transitions. Word has length 172 [2019-12-07 11:30:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:31,616 INFO L462 AbstractCegarLoop]: Abstraction has 2284 states and 3427 transitions. [2019-12-07 11:30:31,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3427 transitions. [2019-12-07 11:30:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 11:30:31,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:31,617 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] [2019-12-07 11:30:31,617 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash 413118599, now seen corresponding path program 1 times [2019-12-07 11:30:31,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:31,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001281232] [2019-12-07 11:30:31,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:31,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001281232] [2019-12-07 11:30:31,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:31,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:31,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391594149] [2019-12-07 11:30:31,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:31,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:31,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:31,658 INFO L87 Difference]: Start difference. First operand 2284 states and 3427 transitions. Second operand 4 states. [2019-12-07 11:30:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:32,027 INFO L93 Difference]: Finished difference Result 4729 states and 7066 transitions. [2019-12-07 11:30:32,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:32,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 11:30:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:32,029 INFO L225 Difference]: With dead ends: 4729 [2019-12-07 11:30:32,029 INFO L226 Difference]: Without dead ends: 2464 [2019-12-07 11:30:32,030 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 11:30:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-12-07 11:30:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2284. [2019-12-07 11:30:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2019-12-07 11:30:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3422 transitions. [2019-12-07 11:30:32,103 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3422 transitions. Word has length 172 [2019-12-07 11:30:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:32,103 INFO L462 AbstractCegarLoop]: Abstraction has 2284 states and 3422 transitions. [2019-12-07 11:30:32,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3422 transitions. [2019-12-07 11:30:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 11:30:32,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:32,104 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:32,104 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2120350472, now seen corresponding path program 1 times [2019-12-07 11:30:32,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:32,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215748904] [2019-12-07 11:30:32,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 11:30:32,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215748904] [2019-12-07 11:30:32,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:32,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:32,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178772142] [2019-12-07 11:30:32,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:32,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:32,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:32,135 INFO L87 Difference]: Start difference. First operand 2284 states and 3422 transitions. Second operand 3 states. [2019-12-07 11:30:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:32,238 INFO L93 Difference]: Finished difference Result 4576 states and 6859 transitions. [2019-12-07 11:30:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:32,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 11:30:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:32,240 INFO L225 Difference]: With dead ends: 4576 [2019-12-07 11:30:32,240 INFO L226 Difference]: Without dead ends: 2311 [2019-12-07 11:30:32,241 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 11:30:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2019-12-07 11:30:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2019-12-07 11:30:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-12-07 11:30:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 3457 transitions. [2019-12-07 11:30:32,315 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 3457 transitions. Word has length 172 [2019-12-07 11:30:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:32,315 INFO L462 AbstractCegarLoop]: Abstraction has 2311 states and 3457 transitions. [2019-12-07 11:30:32,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3457 transitions. [2019-12-07 11:30:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 11:30:32,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:32,316 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:32,316 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash 769425146, now seen corresponding path program 1 times [2019-12-07 11:30:32,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:32,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55715095] [2019-12-07 11:30:32,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 11:30:32,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55715095] [2019-12-07 11:30:32,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:32,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:30:32,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812647208] [2019-12-07 11:30:32,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:30:32,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:30:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:30:32,344 INFO L87 Difference]: Start difference. First operand 2311 states and 3457 transitions. Second operand 3 states. [2019-12-07 11:30:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:32,418 INFO L93 Difference]: Finished difference Result 4145 states and 6205 transitions. [2019-12-07 11:30:32,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:32,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-12-07 11:30:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:32,420 INFO L225 Difference]: With dead ends: 4145 [2019-12-07 11:30:32,420 INFO L226 Difference]: Without dead ends: 1853 [2019-12-07 11:30:32,421 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 11:30:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-12-07 11:30:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2019-12-07 11:30:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-12-07 11:30:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2769 transitions. [2019-12-07 11:30:32,482 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2769 transitions. Word has length 172 [2019-12-07 11:30:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:32,482 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2769 transitions. [2019-12-07 11:30:32,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:30:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2769 transitions. [2019-12-07 11:30:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 11:30:32,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:32,483 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] [2019-12-07 11:30:32,483 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:32,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:32,483 INFO L82 PathProgramCache]: Analyzing trace with hash 916128046, now seen corresponding path program 1 times [2019-12-07 11:30:32,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:32,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429304314] [2019-12-07 11:30:32,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:32,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429304314] [2019-12-07 11:30:32,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:32,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:32,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637855608] [2019-12-07 11:30:32,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:32,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:32,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:32,523 INFO L87 Difference]: Start difference. First operand 1853 states and 2769 transitions. Second operand 4 states. [2019-12-07 11:30:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:32,887 INFO L93 Difference]: Finished difference Result 3830 states and 5701 transitions. [2019-12-07 11:30:32,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:32,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-12-07 11:30:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:32,890 INFO L225 Difference]: With dead ends: 3830 [2019-12-07 11:30:32,890 INFO L226 Difference]: Without dead ends: 1998 [2019-12-07 11:30:32,891 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 11:30:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-12-07 11:30:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2019-12-07 11:30:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-12-07 11:30:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2765 transitions. [2019-12-07 11:30:32,952 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2765 transitions. Word has length 173 [2019-12-07 11:30:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:32,952 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2765 transitions. [2019-12-07 11:30:32,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2765 transitions. [2019-12-07 11:30:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 11:30:32,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:32,953 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] [2019-12-07 11:30:32,953 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -117510462, now seen corresponding path program 1 times [2019-12-07 11:30:32,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:32,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822698214] [2019-12-07 11:30:32,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:32,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822698214] [2019-12-07 11:30:32,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:32,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:32,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635050432] [2019-12-07 11:30:32,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:32,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:32,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:32,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:32,998 INFO L87 Difference]: Start difference. First operand 1853 states and 2765 transitions. Second operand 4 states. [2019-12-07 11:30:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:33,366 INFO L93 Difference]: Finished difference Result 3830 states and 5693 transitions. [2019-12-07 11:30:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:33,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-12-07 11:30:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:33,368 INFO L225 Difference]: With dead ends: 3830 [2019-12-07 11:30:33,368 INFO L226 Difference]: Without dead ends: 1998 [2019-12-07 11:30:33,369 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 11:30:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-12-07 11:30:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2019-12-07 11:30:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-12-07 11:30:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2761 transitions. [2019-12-07 11:30:33,431 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2761 transitions. Word has length 174 [2019-12-07 11:30:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:33,431 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2761 transitions. [2019-12-07 11:30:33,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2761 transitions. [2019-12-07 11:30:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 11:30:33,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:33,432 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] [2019-12-07 11:30:33,432 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1542595319, now seen corresponding path program 1 times [2019-12-07 11:30:33,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:33,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502393913] [2019-12-07 11:30:33,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:33,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502393913] [2019-12-07 11:30:33,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:33,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:33,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55584161] [2019-12-07 11:30:33,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:33,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:33,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:33,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:33,490 INFO L87 Difference]: Start difference. First operand 1853 states and 2761 transitions. Second operand 4 states. [2019-12-07 11:30:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:33,834 INFO L93 Difference]: Finished difference Result 3790 states and 5637 transitions. [2019-12-07 11:30:33,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:33,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-12-07 11:30:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:33,836 INFO L225 Difference]: With dead ends: 3790 [2019-12-07 11:30:33,836 INFO L226 Difference]: Without dead ends: 1958 [2019-12-07 11:30: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 11:30:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-12-07 11:30:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1853. [2019-12-07 11:30:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-12-07 11:30:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2757 transitions. [2019-12-07 11:30:33,899 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2757 transitions. Word has length 175 [2019-12-07 11:30:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:33,899 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2757 transitions. [2019-12-07 11:30:33,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2757 transitions. [2019-12-07 11:30:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 11:30:33,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:33,900 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] [2019-12-07 11:30:33,901 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash 198256685, now seen corresponding path program 1 times [2019-12-07 11:30:33,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:33,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652534808] [2019-12-07 11:30:33,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 11:30:33,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652534808] [2019-12-07 11:30:33,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:33,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:30:33,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898474009] [2019-12-07 11:30:33,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:33,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:33,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:33,976 INFO L87 Difference]: Start difference. First operand 1853 states and 2757 transitions. Second operand 5 states. [2019-12-07 11:30:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:34,444 INFO L93 Difference]: Finished difference Result 4139 states and 6177 transitions. [2019-12-07 11:30:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:34,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-12-07 11:30:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:34,447 INFO L225 Difference]: With dead ends: 4139 [2019-12-07 11:30:34,447 INFO L226 Difference]: Without dead ends: 2307 [2019-12-07 11:30:34,448 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 11:30:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-12-07 11:30:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2012. [2019-12-07 11:30:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-12-07 11:30:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3044 transitions. [2019-12-07 11:30:34,512 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3044 transitions. Word has length 177 [2019-12-07 11:30:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:34,513 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 3044 transitions. [2019-12-07 11:30:34,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3044 transitions. [2019-12-07 11:30:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 11:30:34,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:34,514 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 11:30:34,514 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -128602397, now seen corresponding path program 1 times [2019-12-07 11:30:34,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:34,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462659817] [2019-12-07 11:30:34,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 11:30:34,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462659817] [2019-12-07 11:30:34,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:34,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:30:34,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740900878] [2019-12-07 11:30:34,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:34,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:34,593 INFO L87 Difference]: Start difference. First operand 2012 states and 3044 transitions. Second operand 5 states. [2019-12-07 11:30:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:35,019 INFO L93 Difference]: Finished difference Result 4410 states and 6684 transitions. [2019-12-07 11:30:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:35,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-12-07 11:30:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:35,021 INFO L225 Difference]: With dead ends: 4410 [2019-12-07 11:30:35,021 INFO L226 Difference]: Without dead ends: 2419 [2019-12-07 11:30:35,022 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 11:30:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2019-12-07 11:30:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2122. [2019-12-07 11:30:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-12-07 11:30:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3266 transitions. [2019-12-07 11:30:35,089 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3266 transitions. Word has length 178 [2019-12-07 11:30:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:35,089 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3266 transitions. [2019-12-07 11:30:35,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3266 transitions. [2019-12-07 11:30:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 11:30:35,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:35,090 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:30:35,090 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2019-12-07 11:30:35,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:35,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53613656] [2019-12-07 11:30:35,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:35,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53613656] [2019-12-07 11:30:35,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934985205] [2019-12-07 11:30:35,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:30:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:35,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 11:30:35,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:35,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,513 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 11:30:35,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,537 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 11:30:35,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,569 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 11:30:35,570 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:35,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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 11:30:35,607 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,646 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:30:35,646 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 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 11:30:35,647 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,657 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 11:30:35,657 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 11:30:35,690 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:30:35,691 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 11:30:35,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,697 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:30:35,726 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:30:35,726 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 11:30:35,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,733 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:30:35,737 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 11:30:35,741 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 11:30:35,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,785 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 11:30:35,786 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 11:30:35,786 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,793 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,793 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 11:30:35,816 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:30:35,816 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 11:30:35,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:30:35,844 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 11:30:35,845 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 11:30:35,845 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,854 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 11:30:35,860 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 11:30:35,862 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 11:30:35,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,911 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 11:30:35,912 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 11:30:35,913 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:35,921 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:35,921 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 11:30:35,927 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-12-07 11:30:35,930 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 49 treesize of output 37 [2019-12-07 11:30:35,930 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 11:30:35,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,018 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 11:30:36,019 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 11:30:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,044 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 11:30:36,114 INFO L614 ElimStorePlain]: treesize reduction 1116, result has 4.5 percent of original size [2019-12-07 11:30:36,114 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,114 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 11:30:36,117 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-12-07 11:30:36,119 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 11:30:36,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,163 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 11:30:36,163 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 11:30:36,164 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,172 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 11:30:36,177 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-12-07 11:30:36,179 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 49 treesize of output 37 [2019-12-07 11:30:36,179 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 11:30:36,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,254 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 11:30:36,255 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 11:30:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,257 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,278 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 11:30:36,278 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,278 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 11:30:36,281 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_163|], 6=[|v_#memory_$Pointer$.base_164|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-12-07 11:30:36,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 11:30:36,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,344 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 11:30:36,344 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,391 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 90 treesize of output 62 [2019-12-07 11:30:36,391 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,422 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 11:30:36,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,451 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:30:36,475 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-12-07 11:30:36,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 137 treesize of output 119 [2019-12-07 11:30:36,492 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,591 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 11:30:36,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-12-07 11:30:36,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:36,594 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,605 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,619 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 11:30:36,644 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_int_179|]} [2019-12-07 11:30:36,646 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 53 treesize of output 41 [2019-12-07 11:30:36,647 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 11:30:36,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:30:36,665 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 93 treesize of output 45 [2019-12-07 11:30:36,665 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 11:30:36,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,680 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 11:30:36,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 11:30:36,681 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:36,686 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:36,687 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:30:36,687 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-12-07 11:30:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:30:36,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:30:36,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 11:30:36,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692077942] [2019-12-07 11:30:36,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:30:36,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:30:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:30:36,984 INFO L87 Difference]: Start difference. First operand 2122 states and 3266 transitions. Second operand 10 states. [2019-12-07 11:30:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:39,103 INFO L93 Difference]: Finished difference Result 9082 states and 13871 transitions. [2019-12-07 11:30:39,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:30:39,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2019-12-07 11:30:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:39,113 INFO L225 Difference]: With dead ends: 9082 [2019-12-07 11:30:39,113 INFO L226 Difference]: Without dead ends: 6981 [2019-12-07 11:30:39,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:30:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2019-12-07 11:30:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 4657. [2019-12-07 11:30:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-07 11:30:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 7311 transitions. [2019-12-07 11:30:39,320 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 7311 transitions. Word has length 191 [2019-12-07 11:30:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:39,320 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 7311 transitions. [2019-12-07 11:30:39,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:30:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 7311 transitions. [2019-12-07 11:30:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-07 11:30:39,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:39,324 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:39,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:39,525 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:39,525 INFO L82 PathProgramCache]: Analyzing trace with hash 877150553, now seen corresponding path program 1 times [2019-12-07 11:30:39,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:39,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46848699] [2019-12-07 11:30:39,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 11:30:39,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46848699] [2019-12-07 11:30:39,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:39,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:39,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527854421] [2019-12-07 11:30:39,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:39,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:39,584 INFO L87 Difference]: Start difference. First operand 4657 states and 7311 transitions. Second operand 4 states. [2019-12-07 11:30:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:40,071 INFO L93 Difference]: Finished difference Result 9503 states and 14876 transitions. [2019-12-07 11:30:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:40,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-12-07 11:30:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:40,078 INFO L225 Difference]: With dead ends: 9503 [2019-12-07 11:30:40,078 INFO L226 Difference]: Without dead ends: 4867 [2019-12-07 11:30:40,080 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 11:30:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2019-12-07 11:30:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4657. [2019-12-07 11:30:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-07 11:30:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 7303 transitions. [2019-12-07 11:30:40,257 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 7303 transitions. Word has length 199 [2019-12-07 11:30:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:40,257 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 7303 transitions. [2019-12-07 11:30:40,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 7303 transitions. [2019-12-07 11:30:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-07 11:30:40,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:40,259 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:40,260 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -19453550, now seen corresponding path program 1 times [2019-12-07 11:30:40,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:40,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065432872] [2019-12-07 11:30:40,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 11:30:40,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065432872] [2019-12-07 11:30:40,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:40,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:30:40,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020408020] [2019-12-07 11:30:40,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:40,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:40,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:40,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:40,314 INFO L87 Difference]: Start difference. First operand 4657 states and 7303 transitions. Second operand 4 states. [2019-12-07 11:30:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:40,863 INFO L93 Difference]: Finished difference Result 9487 states and 14844 transitions. [2019-12-07 11:30:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:40,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-12-07 11:30:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:40,868 INFO L225 Difference]: With dead ends: 9487 [2019-12-07 11:30:40,868 INFO L226 Difference]: Without dead ends: 4851 [2019-12-07 11:30:40,870 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 11:30:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2019-12-07 11:30:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4657. [2019-12-07 11:30:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-07 11:30:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 7295 transitions. [2019-12-07 11:30:41,035 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 7295 transitions. Word has length 200 [2019-12-07 11:30:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:41,035 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 7295 transitions. [2019-12-07 11:30:41,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 7295 transitions. [2019-12-07 11:30:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-12-07 11:30:41,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:41,038 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:41,038 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash 477049331, now seen corresponding path program 1 times [2019-12-07 11:30:41,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:41,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193467803] [2019-12-07 11:30:41,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-12-07 11:30:41,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193467803] [2019-12-07 11:30:41,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:41,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:30:41,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763167442] [2019-12-07 11:30:41,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:30:41,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:30:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:30:41,124 INFO L87 Difference]: Start difference. First operand 4657 states and 7295 transitions. Second operand 6 states. [2019-12-07 11:30:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:42,113 INFO L93 Difference]: Finished difference Result 10701 states and 16727 transitions. [2019-12-07 11:30:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:30:42,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-12-07 11:30:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:42,118 INFO L225 Difference]: With dead ends: 10701 [2019-12-07 11:30:42,118 INFO L226 Difference]: Without dead ends: 6065 [2019-12-07 11:30:42,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:30:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2019-12-07 11:30:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 4725. [2019-12-07 11:30:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-07 11:30:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7399 transitions. [2019-12-07 11:30:42,286 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7399 transitions. Word has length 204 [2019-12-07 11:30:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:42,286 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7399 transitions. [2019-12-07 11:30:42,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:30:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7399 transitions. [2019-12-07 11:30:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-12-07 11:30:42,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:42,289 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:42,289 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash 462310456, now seen corresponding path program 1 times [2019-12-07 11:30:42,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:42,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42098492] [2019-12-07 11:30:42,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-12-07 11:30:42,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42098492] [2019-12-07 11:30:42,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:42,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:30:42,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426582184] [2019-12-07 11:30:42,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:30:42,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:30:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:30:42,378 INFO L87 Difference]: Start difference. First operand 4725 states and 7399 transitions. Second operand 6 states. [2019-12-07 11:30:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:43,331 INFO L93 Difference]: Finished difference Result 10401 states and 16163 transitions. [2019-12-07 11:30:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:30:43,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-12-07 11:30:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:43,335 INFO L225 Difference]: With dead ends: 10401 [2019-12-07 11:30:43,336 INFO L226 Difference]: Without dead ends: 5697 [2019-12-07 11:30:43,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:30:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2019-12-07 11:30:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 4729. [2019-12-07 11:30:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4729 states. [2019-12-07 11:30:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 4729 states and 7387 transitions. [2019-12-07 11:30:43,517 INFO L78 Accepts]: Start accepts. Automaton has 4729 states and 7387 transitions. Word has length 205 [2019-12-07 11:30:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:43,517 INFO L462 AbstractCegarLoop]: Abstraction has 4729 states and 7387 transitions. [2019-12-07 11:30:43,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:30:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4729 states and 7387 transitions. [2019-12-07 11:30:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-07 11:30:43,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:43,519 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:43,519 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -412411121, now seen corresponding path program 1 times [2019-12-07 11:30:43,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:43,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565675477] [2019-12-07 11:30:43,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 11:30:43,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565675477] [2019-12-07 11:30:43,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:43,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:30:43,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145292552] [2019-12-07 11:30:43,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:43,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:43,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:43,603 INFO L87 Difference]: Start difference. First operand 4729 states and 7387 transitions. Second operand 5 states. [2019-12-07 11:30:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:44,193 INFO L93 Difference]: Finished difference Result 10369 states and 16181 transitions. [2019-12-07 11:30:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:44,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-12-07 11:30:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:44,198 INFO L225 Difference]: With dead ends: 10369 [2019-12-07 11:30:44,198 INFO L226 Difference]: Without dead ends: 5661 [2019-12-07 11:30:44,200 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 11:30:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2019-12-07 11:30:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5025. [2019-12-07 11:30:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-12-07 11:30:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7907 transitions. [2019-12-07 11:30:44,364 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7907 transitions. Word has length 211 [2019-12-07 11:30:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:44,364 INFO L462 AbstractCegarLoop]: Abstraction has 5025 states and 7907 transitions. [2019-12-07 11:30:44,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7907 transitions. [2019-12-07 11:30:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 11:30:44,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:44,367 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:44,367 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash -760223515, now seen corresponding path program 1 times [2019-12-07 11:30:44,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:44,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770543480] [2019-12-07 11:30:44,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 11:30:44,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770543480] [2019-12-07 11:30:44,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:44,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:30:44,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910292170] [2019-12-07 11:30:44,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:30:44,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:30:44,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:30:44,451 INFO L87 Difference]: Start difference. First operand 5025 states and 7907 transitions. Second operand 5 states. [2019-12-07 11:30:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:45,066 INFO L93 Difference]: Finished difference Result 10641 states and 16653 transitions. [2019-12-07 11:30:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:45,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-12-07 11:30:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:45,070 INFO L225 Difference]: With dead ends: 10641 [2019-12-07 11:30:45,070 INFO L226 Difference]: Without dead ends: 5637 [2019-12-07 11:30:45,072 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 11:30:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2019-12-07 11:30:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 5013. [2019-12-07 11:30:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5013 states. [2019-12-07 11:30:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 7879 transitions. [2019-12-07 11:30:45,239 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 7879 transitions. Word has length 212 [2019-12-07 11:30:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:45,239 INFO L462 AbstractCegarLoop]: Abstraction has 5013 states and 7879 transitions. [2019-12-07 11:30:45,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:30:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 7879 transitions. [2019-12-07 11:30:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-12-07 11:30:45,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:45,242 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:45,242 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:45,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2003024104, now seen corresponding path program 1 times [2019-12-07 11:30:45,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:30:45,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483350561] [2019-12-07 11:30:45,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:30:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-12-07 11:30:45,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483350561] [2019-12-07 11:30:45,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834854913] [2019-12-07 11:30:45,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:45,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:30:45,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:45,487 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 20 treesize of output 8 [2019-12-07 11:30:45,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:45,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:45,488 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:45,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 11:30:45,498 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_163|], 5=[|v_#memory_int_180|]} [2019-12-07 11:30:45,499 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 81 treesize of output 63 [2019-12-07 11:30:45,499 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 11:30:45,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:45,503 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 63 treesize of output 51 [2019-12-07 11:30:45,503 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 11:30:45,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:45,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:45,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-12-07 11:30:45,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:30:45,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:45,543 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@42b2b53d [2019-12-07 11:30:45,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:30:45,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-12-07 11:30:45,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614792306] [2019-12-07 11:30:45,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:30:45,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:30:45,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:30:45,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:30:45,544 INFO L87 Difference]: Start difference. First operand 5013 states and 7879 transitions. Second operand 6 states. [2019-12-07 11:30:45,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:30:45,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:30:45,746 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@42b2b53d at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:30:45,755 INFO L168 Benchmark]: Toolchain (without parser) took 51138.47 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 661.1 MB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -275.4 MB). Peak memory consumption was 385.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:45,756 INFO L168 Benchmark]: CDTParser took 0.14 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 11:30:45,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:45,757 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.97 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 11:30:45,758 INFO L168 Benchmark]: Boogie Preprocessor took 65.98 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:45,759 INFO L168 Benchmark]: RCFGBuilder took 694.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 965.1 MB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:45,759 INFO L168 Benchmark]: TraceAbstraction took 49853.07 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 558.9 MB). Free memory was 965.1 MB in the beginning and 1.2 GB in the end (delta: -248.4 MB). Peak memory consumption was 310.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:30:45,764 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 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 454.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.97 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 65.98 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: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 694.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 965.1 MB in the end (delta: 98.1 MB). Peak memory consumption was 98.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49853.07 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 558.9 MB). Free memory was 965.1 MB in the beginning and 1.2 GB in the end (delta: -248.4 MB). Peak memory consumption was 310.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@42b2b53d de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@42b2b53d: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:30:47,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:30:47,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:30:47,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:30:47,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:30:47,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:30:47,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:30:47,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:30:47,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:30:47,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:30:47,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:30:47,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:30:47,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:30:47,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:30:47,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:30:47,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:30:47,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:30:47,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:30:47,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:30:47,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:30:47,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:30:47,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:30:47,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:30:47,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:30:47,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:30:47,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:30:47,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:30:47,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:30:47,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:30:47,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:30:47,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:30:47,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:30:47,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:30:47,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:30:47,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:30:47,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:30:47,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:30:47,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:30:47,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:30:47,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:30:47,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:30:47,209 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 11:30:47,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:30:47,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:30:47,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:30:47,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:30:47,220 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:30:47,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:30:47,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:30:47,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:30:47,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:30:47,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:30:47,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:30:47,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:30:47,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:30:47,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:30:47,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:30:47,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:30:47,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:30:47,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:30:47,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:30:47,223 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 11:30:47,223 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:30:47,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:30:47,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:30:47,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:30:47,223 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_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-12-07 11:30:47,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:30:47,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:30:47,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:30:47,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:30:47,395 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:30:47,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-12-07 11:30:47,432 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/a4d8f5aa7/faa9593b518549e994448d9f7f2c02b5/FLAG782f44ed2 [2019-12-07 11:30:47,857 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:30:47,858 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-12-07 11:30:47,871 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/a4d8f5aa7/faa9593b518549e994448d9f7f2c02b5/FLAG782f44ed2 [2019-12-07 11:30:47,879 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/data/a4d8f5aa7/faa9593b518549e994448d9f7f2c02b5 [2019-12-07 11:30:47,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:30:47,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:30:47,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:30:47,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:30:47,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:30:47,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:30:47" (1/1) ... [2019-12-07 11:30:47,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10831c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:47, skipping insertion in model container [2019-12-07 11:30:47,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:30:47" (1/1) ... [2019-12-07 11:30:47,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:30:47,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:30:48,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:30:48,222 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:30:48,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:30:48,301 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:30:48,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48 WrapperNode [2019-12-07 11:30:48,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:30:48,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:30:48,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:30:48,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:30:48,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:30:48,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:30:48,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:30:48,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:30:48,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... [2019-12-07 11:30:48,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:30:48,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:30:48,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:30:48,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:30:48,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:30:48,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:30:48,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:30:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 11:30:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:30:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:30:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:30:48,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:30:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 11:30:48,654 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:30:50,830 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 11:30:50,830 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 11:30:50,831 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:30:50,831 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:30:50,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:30:50 BoogieIcfgContainer [2019-12-07 11:30:50,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:30:50,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:30:50,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:30:50,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:30:50,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:30:47" (1/3) ... [2019-12-07 11:30:50,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465951c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:30:50, skipping insertion in model container [2019-12-07 11:30:50,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:30:48" (2/3) ... [2019-12-07 11:30:50,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465951c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:30:50, skipping insertion in model container [2019-12-07 11:30:50,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:30:50" (3/3) ... [2019-12-07 11:30:50,837 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-12-07 11:30:50,844 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:30:50,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:30:50,857 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:30:50,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:30:50,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:30:50,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:30:50,874 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:30:50,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:30:50,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:30:50,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:30:50,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:30:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-12-07 11:30:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:30:50,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:50,894 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:50,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:50,898 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2019-12-07 11:30:50,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:30:50,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512676332] [2019-12-07 11:30:50,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:30:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:51,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:30:51,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:51,126 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:30:51,127 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:30:51,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:51,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:51,138 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:51,139 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:30:51,172 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:30:51,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:30:51,175 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:51,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:51,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:51,179 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:30:51,185 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 11:30:51,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:51,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:51,187 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 11:30:51,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:30:51,203 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 11:30:51,203 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:30:51,220 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 11:30:51,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512676332] [2019-12-07 11:30:51,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:51,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:30:51,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009187386] [2019-12-07 11:30:51,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:51,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:30:51,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:51,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:51,236 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-12-07 11:30:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:53,646 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2019-12-07 11:30:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:30:53,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 11:30:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:53,658 INFO L225 Difference]: With dead ends: 329 [2019-12-07 11:30:53,658 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 11:30:53,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 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 11:30:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 11:30:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-12-07 11:30:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 11:30:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2019-12-07 11:30:53,700 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 43 [2019-12-07 11:30:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:53,700 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2019-12-07 11:30:53,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2019-12-07 11:30:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:30:53,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:53,703 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:53,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:30:53,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:53,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1905377872, now seen corresponding path program 1 times [2019-12-07 11:30:53,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:30:53,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942051546] [2019-12-07 11:30:53,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:30:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:54,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:30:54,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:54,136 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:30:54,137 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:30:54,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:54,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:54,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:54,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:30:54,165 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:30:54,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:30:54,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:54,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:54,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:54,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:30:54,172 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 11:30:54,172 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:54,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:54,174 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 11:30:54,174 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:30:54,182 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 11:30:54,183 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:30:54,219 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 11:30:54,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942051546] [2019-12-07 11:30:54,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:54,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:30:54,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198868546] [2019-12-07 11:30:54,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:30:54,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:30:54,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:30:54,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:30:54,221 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand 6 states. [2019-12-07 11:31:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:01,609 INFO L93 Difference]: Finished difference Result 415 states and 641 transitions. [2019-12-07 11:31:01,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:31:01,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 11:31:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:01,613 INFO L225 Difference]: With dead ends: 415 [2019-12-07 11:31:01,613 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 11:31:01,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:31:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 11:31:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2019-12-07 11:31:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-12-07 11:31:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 257 transitions. [2019-12-07 11:31:01,625 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 257 transitions. Word has length 56 [2019-12-07 11:31:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:01,626 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 257 transitions. [2019-12-07 11:31:01,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 257 transitions. [2019-12-07 11:31:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:31:01,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:01,628 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:01,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:31:01,829 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:01,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1255882526, now seen corresponding path program 1 times [2019-12-07 11:31:01,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:31:01,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847056050] [2019-12-07 11:31:01,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:31:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:01,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:31:01,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:01,968 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 4=[|v_#memory_int_188|]} [2019-12-07 11:31:01,970 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 11:31:01,970 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 11:31:01,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:01,979 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 11:31:01,980 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 11:31:01,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:02,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:02,020 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 11:31:02,021 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:10,101 WARN L192 SmtUtils]: Spent 8.08 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 11:31:10,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:10,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:10,103 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 11:31:10,112 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 11:31:10,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:10,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:10,114 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 11:31:10,114 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:31:10,123 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 11:31:10,124 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:10,129 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 11:31:10,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847056050] [2019-12-07 11:31:10,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:10,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:31:10,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097382005] [2019-12-07 11:31:10,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:31:10,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:31:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:31:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:31:10,130 INFO L87 Difference]: Start difference. First operand 165 states and 257 transitions. Second operand 4 states. [2019-12-07 11:31:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:13,797 INFO L93 Difference]: Finished difference Result 340 states and 528 transitions. [2019-12-07 11:31:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:31:13,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 11:31:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:13,800 INFO L225 Difference]: With dead ends: 340 [2019-12-07 11:31:13,800 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 11:31:13,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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 11:31:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 11:31:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-12-07 11:31:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-12-07 11:31:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 283 transitions. [2019-12-07 11:31:13,808 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 283 transitions. Word has length 57 [2019-12-07 11:31:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:13,808 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 283 transitions. [2019-12-07 11:31:13,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:31:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 283 transitions. [2019-12-07 11:31:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:31:13,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:13,810 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:14,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:31:14,011 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2070651149, now seen corresponding path program 1 times [2019-12-07 11:31:14,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:31:14,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156917270] [2019-12-07 11:31:14,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:31:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:14,158 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:31:14,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:14,175 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:31:14,175 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:31:14,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:14,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:14,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:14,184 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:31:14,203 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:31:14,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:31:14,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:14,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:14,207 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:14,207 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:31:14,211 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 11:31:14,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:14,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:14,213 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 11:31:14,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:31:14,222 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 11:31:14,222 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:14,250 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 11:31:14,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156917270] [2019-12-07 11:31:14,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:14,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:31:14,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592300310] [2019-12-07 11:31:14,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:14,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:31:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:31:14,252 INFO L87 Difference]: Start difference. First operand 181 states and 283 transitions. Second operand 6 states. [2019-12-07 11:31:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:20,895 INFO L93 Difference]: Finished difference Result 461 states and 715 transitions. [2019-12-07 11:31:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:31:20,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 11:31:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:20,897 INFO L225 Difference]: With dead ends: 461 [2019-12-07 11:31:20,898 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 11:31:20,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:31:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 11:31:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 182. [2019-12-07 11:31:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 11:31:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 283 transitions. [2019-12-07 11:31:20,908 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 283 transitions. Word has length 57 [2019-12-07 11:31:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:20,908 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 283 transitions. [2019-12-07 11:31:20,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 283 transitions. [2019-12-07 11:31:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:31:20,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:20,910 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:21,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 11:31:21,111 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash -221095859, now seen corresponding path program 1 times [2019-12-07 11:31:21,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:31:21,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345250999] [2019-12-07 11:31:21,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:31:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:21,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:31:21,206 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:21,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 11:31:21,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:21,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:21,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:21,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:31:21,224 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 11:31:21,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:21,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:21,227 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 11:31:21,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:31:21,241 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 11:31:21,241 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:21,267 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 11:31:21,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345250999] [2019-12-07 11:31:21,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:21,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:31:21,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952355896] [2019-12-07 11:31:21,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:21,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:31:21,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:21,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:31:21,269 INFO L87 Difference]: Start difference. First operand 182 states and 283 transitions. Second operand 6 states. [2019-12-07 11:31:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:28,345 INFO L93 Difference]: Finished difference Result 571 states and 887 transitions. [2019-12-07 11:31:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:31:28,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 11:31:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:28,348 INFO L225 Difference]: With dead ends: 571 [2019-12-07 11:31:28,348 INFO L226 Difference]: Without dead ends: 408 [2019-12-07 11:31:28,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:31:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-12-07 11:31:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 222. [2019-12-07 11:31:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 11:31:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 354 transitions. [2019-12-07 11:31:28,358 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 354 transitions. Word has length 57 [2019-12-07 11:31:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:28,358 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 354 transitions. [2019-12-07 11:31:28,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 354 transitions. [2019-12-07 11:31:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:31:28,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:28,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:28,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 11:31:28,561 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:28,562 INFO L82 PathProgramCache]: Analyzing trace with hash -243629373, now seen corresponding path program 1 times [2019-12-07 11:31:28,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:31:28,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543607295] [2019-12-07 11:31:28,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:31:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:28,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:31:28,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:28,714 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 11:31:28,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:28,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,717 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:31:28,724 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 11:31:28,725 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:28,726 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 11:31:28,726 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:31:28,735 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 11:31:28,735 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:28,756 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 11:31:28,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543607295] [2019-12-07 11:31:28,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:28,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:31:28,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579952120] [2019-12-07 11:31:28,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:28,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:31:28,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:31:28,757 INFO L87 Difference]: Start difference. First operand 222 states and 354 transitions. Second operand 6 states. [2019-12-07 11:31:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:34,536 INFO L93 Difference]: Finished difference Result 625 states and 989 transitions. [2019-12-07 11:31:34,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:31:34,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 11:31:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:34,539 INFO L225 Difference]: With dead ends: 625 [2019-12-07 11:31:34,539 INFO L226 Difference]: Without dead ends: 422 [2019-12-07 11:31:34,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:31:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-07 11:31:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 245. [2019-12-07 11:31:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 11:31:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 399 transitions. [2019-12-07 11:31:34,548 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 399 transitions. Word has length 58 [2019-12-07 11:31:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:34,549 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 399 transitions. [2019-12-07 11:31:34,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 399 transitions. [2019-12-07 11:31:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 11:31:34,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:34,550 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:34,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 11:31:34,751 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1777023767, now seen corresponding path program 1 times [2019-12-07 11:31:34,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:31:34,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635541496] [2019-12-07 11:31:34,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:31:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:34,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:31:34,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:34,856 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 11:31:34,856 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:34,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:34,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:34,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:31:34,866 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 11:31:34,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:34,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:34,868 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 11:31:34,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:31:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:34,879 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:34,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635541496] [2019-12-07 11:31:34,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:34,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:31:34,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43759115] [2019-12-07 11:31:34,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:34,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:31:34,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:34,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:31:34,906 INFO L87 Difference]: Start difference. First operand 245 states and 399 transitions. Second operand 6 states. [2019-12-07 11:31:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:40,383 INFO L93 Difference]: Finished difference Result 721 states and 1166 transitions. [2019-12-07 11:31:40,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:31:40,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-07 11:31:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:40,386 INFO L225 Difference]: With dead ends: 721 [2019-12-07 11:31:40,386 INFO L226 Difference]: Without dead ends: 495 [2019-12-07 11:31:40,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:31:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-12-07 11:31:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 309. [2019-12-07 11:31:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-07 11:31:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 511 transitions. [2019-12-07 11:31:40,393 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 511 transitions. Word has length 86 [2019-12-07 11:31:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:40,393 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 511 transitions. [2019-12-07 11:31:40,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 511 transitions. [2019-12-07 11:31:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 11:31:40,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:40,394 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:40,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 11:31:40,595 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1295532847, now seen corresponding path program 1 times [2019-12-07 11:31:40,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:31:40,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320355343] [2019-12-07 11:31:40,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:31:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:40,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:31:40,703 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:40,706 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 11:31:40,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:40,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:40,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:40,709 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:31:40,718 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 11:31:40,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:40,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:40,721 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 11:31:40,721 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:31:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:40,735 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:40,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320355343] [2019-12-07 11:31:40,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:40,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:31:40,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023932031] [2019-12-07 11:31:40,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:40,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:31:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:31:40,766 INFO L87 Difference]: Start difference. First operand 309 states and 511 transitions. Second operand 6 states. [2019-12-07 11:31:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:50,705 INFO L93 Difference]: Finished difference Result 813 states and 1321 transitions. [2019-12-07 11:31:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:31:50,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-12-07 11:31:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:50,708 INFO L225 Difference]: With dead ends: 813 [2019-12-07 11:31:50,708 INFO L226 Difference]: Without dead ends: 523 [2019-12-07 11:31:50,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:31:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-12-07 11:31:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 346. [2019-12-07 11:31:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 11:31:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 575 transitions. [2019-12-07 11:31:50,717 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 575 transitions. Word has length 91 [2019-12-07 11:31:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:50,717 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 575 transitions. [2019-12-07 11:31:50,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 575 transitions. [2019-12-07 11:31:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 11:31:50,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:50,719 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:50,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 11:31:50,920 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash 646431941, now seen corresponding path program 1 times [2019-12-07 11:31:50,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:31:50,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525998535] [2019-12-07 11:31:50,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:31:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:51,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:31:51,127 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:51,131 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 11:31:51,131 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:51,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:51,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:51,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:31:51,143 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 11:31:51,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:51,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:51,145 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 11:31:51,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:31:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:51,172 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:51,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525998535] [2019-12-07 11:31:51,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:51,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:31:51,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44909458] [2019-12-07 11:31:51,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:51,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:31:51,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:31:51,198 INFO L87 Difference]: Start difference. First operand 346 states and 575 transitions. Second operand 6 states. [2019-12-07 11:31:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:59,868 INFO L93 Difference]: Finished difference Result 845 states and 1376 transitions. [2019-12-07 11:31:59,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:31:59,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-07 11:31:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:59,871 INFO L225 Difference]: With dead ends: 845 [2019-12-07 11:31:59,871 INFO L226 Difference]: Without dead ends: 518 [2019-12-07 11:31:59,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:31:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-07 11:31:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 346. [2019-12-07 11:31:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 11:31:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 573 transitions. [2019-12-07 11:31:59,878 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 573 transitions. Word has length 92 [2019-12-07 11:31:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:59,878 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 573 transitions. [2019-12-07 11:31:59,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 573 transitions. [2019-12-07 11:31:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:31:59,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:59,879 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:00,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 11:32:00,081 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:00,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1174626467, now seen corresponding path program 1 times [2019-12-07 11:32:00,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:00,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307806731] [2019-12-07 11:32:00,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:32:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:00,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:32:00,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:00,316 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:32:00,316 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:32:00,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:00,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:00,324 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:00,324 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:32:00,341 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:32:00,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:32:00,342 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:00,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:00,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:00,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:32:00,347 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 11:32:00,347 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:00,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:00,349 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 11:32:00,349 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:32:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:00,359 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:00,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307806731] [2019-12-07 11:32:00,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:00,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:00,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934009406] [2019-12-07 11:32:00,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:00,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:00,389 INFO L87 Difference]: Start difference. First operand 346 states and 573 transitions. Second operand 6 states. [2019-12-07 11:32:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:04,990 INFO L93 Difference]: Finished difference Result 765 states and 1246 transitions. [2019-12-07 11:32:04,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:04,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 11:32:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:04,992 INFO L225 Difference]: With dead ends: 765 [2019-12-07 11:32:04,992 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 11:32:04,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 11:32:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 346. [2019-12-07 11:32:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 11:32:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 566 transitions. [2019-12-07 11:32:05,001 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 566 transitions. Word has length 99 [2019-12-07 11:32:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:05,002 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 566 transitions. [2019-12-07 11:32:05,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 566 transitions. [2019-12-07 11:32:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 11:32:05,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:05,003 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:05,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 11:32:05,204 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1790280433, now seen corresponding path program 1 times [2019-12-07 11:32:05,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:05,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255606954] [2019-12-07 11:32:05,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:32:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:05,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:32:05,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:05,452 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:32:05,452 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:32:05,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:05,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:05,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:05,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:32:05,479 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:32:05,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:32:05,480 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:05,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:05,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:05,482 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:32:05,485 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 11:32:05,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:05,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:05,487 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 11:32:05,487 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:32:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:05,497 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:05,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255606954] [2019-12-07 11:32:05,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:05,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:05,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183507607] [2019-12-07 11:32:05,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:05,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:05,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:05,535 INFO L87 Difference]: Start difference. First operand 346 states and 566 transitions. Second operand 6 states. [2019-12-07 11:32:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:09,378 INFO L93 Difference]: Finished difference Result 765 states and 1233 transitions. [2019-12-07 11:32:09,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:09,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 11:32:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:09,380 INFO L225 Difference]: With dead ends: 765 [2019-12-07 11:32:09,380 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 11:32:09,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 11:32:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 346. [2019-12-07 11:32:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 11:32:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 559 transitions. [2019-12-07 11:32:09,387 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 559 transitions. Word has length 99 [2019-12-07 11:32:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:09,387 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 559 transitions. [2019-12-07 11:32:09,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 559 transitions. [2019-12-07 11:32:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:32:09,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:09,388 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:09,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 11:32:09,589 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -151554348, now seen corresponding path program 1 times [2019-12-07 11:32:09,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:09,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024483529] [2019-12-07 11:32:09,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:32:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:09,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:32:09,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:09,847 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:32:09,848 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:32:09,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:09,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:09,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:09,856 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:32:09,874 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:32:09,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:32:09,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:09,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:09,877 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:09,877 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:32:09,880 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 11:32:09,880 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:09,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:09,881 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 11:32:09,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:32:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:09,901 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:09,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024483529] [2019-12-07 11:32:09,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:09,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:09,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652081602] [2019-12-07 11:32:09,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:09,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:09,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:09,929 INFO L87 Difference]: Start difference. First operand 346 states and 559 transitions. Second operand 6 states. [2019-12-07 11:32:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:15,238 INFO L93 Difference]: Finished difference Result 765 states and 1220 transitions. [2019-12-07 11:32:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:15,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 11:32:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:15,240 INFO L225 Difference]: With dead ends: 765 [2019-12-07 11:32:15,240 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 11:32:15,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 11:32:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 346. [2019-12-07 11:32:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-07 11:32:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 552 transitions. [2019-12-07 11:32:15,246 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 552 transitions. Word has length 100 [2019-12-07 11:32:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:15,247 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 552 transitions. [2019-12-07 11:32:15,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 552 transitions. [2019-12-07 11:32:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 11:32:15,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:15,247 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:15,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 11:32:15,449 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:15,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:15,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2080804085, now seen corresponding path program 1 times [2019-12-07 11:32:15,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:15,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828002549] [2019-12-07 11:32:15,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/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 11:32:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:15,589 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:32:15,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:15,594 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 11:32:15,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:15,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:15,597 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:15,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:32:15,604 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 11:32:15,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:15,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:15,606 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 11:32:15,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:32:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:15,620 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:15,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828002549] [2019-12-07 11:32:15,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:15,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:15,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764858409] [2019-12-07 11:32:15,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:15,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:15,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:15,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:15,648 INFO L87 Difference]: Start difference. First operand 346 states and 552 transitions. Second operand 6 states. [2019-12-07 11:32:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:21,483 INFO L93 Difference]: Finished difference Result 883 states and 1392 transitions. [2019-12-07 11:32:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:21,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 11:32:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:21,486 INFO L225 Difference]: With dead ends: 883 [2019-12-07 11:32:21,486 INFO L226 Difference]: Without dead ends: 556 [2019-12-07 11:32:21,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-12-07 11:32:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 389. [2019-12-07 11:32:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-12-07 11:32:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 622 transitions. [2019-12-07 11:32:21,494 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 622 transitions. Word has length 100 [2019-12-07 11:32:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:21,494 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 622 transitions. [2019-12-07 11:32:21,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 622 transitions. [2019-12-07 11:32:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 11:32:21,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:21,495 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:21,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 11:32:21,696 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2145724330, now seen corresponding path program 1 times [2019-12-07 11:32:21,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:21,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422714079] [2019-12-07 11:32:21,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:21,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:32:21,957 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:21,971 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:32:21,971 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:32:21,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:21,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:21,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:21,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:32:21,995 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:32:21,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:32:21,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:21,998 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:21,998 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:21,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:32:22,001 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 11:32:22,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:22,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:22,003 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 11:32:22,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:32:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:22,014 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:22,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422714079] [2019-12-07 11:32:22,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:22,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:22,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076184693] [2019-12-07 11:32:22,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:22,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:22,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:22,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:22,044 INFO L87 Difference]: Start difference. First operand 389 states and 622 transitions. Second operand 6 states. [2019-12-07 11:32:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:27,620 INFO L93 Difference]: Finished difference Result 851 states and 1347 transitions. [2019-12-07 11:32:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:27,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 11:32:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:27,623 INFO L225 Difference]: With dead ends: 851 [2019-12-07 11:32:27,623 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 11:32:27,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 11:32:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 389. [2019-12-07 11:32:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-12-07 11:32:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 614 transitions. [2019-12-07 11:32:27,631 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 614 transitions. Word has length 101 [2019-12-07 11:32:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:27,631 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 614 transitions. [2019-12-07 11:32:27,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 614 transitions. [2019-12-07 11:32:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 11:32:27,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:27,633 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:27,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 11:32:27,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1754124801, now seen corresponding path program 1 times [2019-12-07 11:32:27,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:27,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784914318] [2019-12-07 11:32:27,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:28,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:32:28,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:28,085 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 11:32:28,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:28,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:28,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:28,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:32:28,096 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 11:32:28,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:28,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:28,099 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 11:32:28,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:32:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:28,121 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:28,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784914318] [2019-12-07 11:32:28,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:28,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:28,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080208571] [2019-12-07 11:32:28,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:28,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:28,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:28,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:28,148 INFO L87 Difference]: Start difference. First operand 389 states and 614 transitions. Second operand 6 states. [2019-12-07 11:32:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:34,013 INFO L93 Difference]: Finished difference Result 923 states and 1440 transitions. [2019-12-07 11:32:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:34,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 11:32:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:34,016 INFO L225 Difference]: With dead ends: 923 [2019-12-07 11:32:34,016 INFO L226 Difference]: Without dead ends: 549 [2019-12-07 11:32:34,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-12-07 11:32:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 391. [2019-12-07 11:32:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-07 11:32:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2019-12-07 11:32:34,023 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 101 [2019-12-07 11:32:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:34,023 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2019-12-07 11:32:34,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2019-12-07 11:32:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 11:32:34,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:34,024 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:34,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 11:32:34,225 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1467318247, now seen corresponding path program 1 times [2019-12-07 11:32:34,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:34,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840738554] [2019-12-07 11:32:34,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:34,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:32:34,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:34,531 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 11:32:34,532 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 11:32:34,532 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:34,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:34,540 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:34,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 11:32:34,558 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 11:32:34,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 11:32:34,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:34,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:34,560 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:34,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 11:32:34,563 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 11:32:34,563 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:34,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:34,564 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 11:32:34,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 11:32:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:34,575 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 11:32:34,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840738554] [2019-12-07 11:32:34,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:34,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:34,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371595621] [2019-12-07 11:32:34,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:34,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:34,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:34,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:34,611 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand 6 states. [2019-12-07 11:32:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:40,758 INFO L93 Difference]: Finished difference Result 831 states and 1305 transitions. [2019-12-07 11:32:40,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:40,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-07 11:32:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:40,761 INFO L225 Difference]: With dead ends: 831 [2019-12-07 11:32:40,761 INFO L226 Difference]: Without dead ends: 459 [2019-12-07 11:32:40,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-07 11:32:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 391. [2019-12-07 11:32:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-07 11:32:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 609 transitions. [2019-12-07 11:32:40,768 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 609 transitions. Word has length 102 [2019-12-07 11:32:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:40,768 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 609 transitions. [2019-12-07 11:32:40,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 609 transitions. [2019-12-07 11:32:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 11:32:40,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:40,769 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:40,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 11:32:40,971 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 643970411, now seen corresponding path program 1 times [2019-12-07 11:32:40,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:40,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456845589] [2019-12-07 11:32:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:41,158 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:32:41,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:41,163 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 11:32:41,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:41,166 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:41,166 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:41,166 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:32:41,173 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 11:32:41,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:41,174 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:41,175 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 11:32:41,175 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:32:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:32:41,189 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:32:41,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456845589] [2019-12-07 11:32:41,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:41,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:41,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349566384] [2019-12-07 11:32:41,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:41,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:41,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:41,215 INFO L87 Difference]: Start difference. First operand 391 states and 609 transitions. Second operand 6 states. [2019-12-07 11:32:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:49,337 INFO L93 Difference]: Finished difference Result 943 states and 1460 transitions. [2019-12-07 11:32:49,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:49,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-12-07 11:32:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:49,340 INFO L225 Difference]: With dead ends: 943 [2019-12-07 11:32:49,340 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 11:32:49,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 11:32:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 421. [2019-12-07 11:32:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-07 11:32:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 651 transitions. [2019-12-07 11:32:49,352 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 651 transitions. Word has length 113 [2019-12-07 11:32:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:49,352 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 651 transitions. [2019-12-07 11:32:49,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 651 transitions. [2019-12-07 11:32:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 11:32:49,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:49,353 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:49,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 11:32:49,555 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash -968645306, now seen corresponding path program 1 times [2019-12-07 11:32:49,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:49,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039069768] [2019-12-07 11:32:49,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:49,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:32:49,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:49,678 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 11:32:49,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:49,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:49,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:49,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:32:49,688 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 11:32:49,689 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:49,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:49,690 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 11:32:49,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:32:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:32:49,704 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:32:49,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039069768] [2019-12-07 11:32:49,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:49,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:49,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534020144] [2019-12-07 11:32:49,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:49,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:49,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:49,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:49,731 INFO L87 Difference]: Start difference. First operand 421 states and 651 transitions. Second operand 6 states. [2019-12-07 11:32:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:55,783 INFO L93 Difference]: Finished difference Result 959 states and 1475 transitions. [2019-12-07 11:32:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:55,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-07 11:32:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:55,786 INFO L225 Difference]: With dead ends: 959 [2019-12-07 11:32:55,786 INFO L226 Difference]: Without dead ends: 557 [2019-12-07 11:32:55,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:32:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-12-07 11:32:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2019-12-07 11:32:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-07 11:32:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 645 transitions. [2019-12-07 11:32:55,794 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 645 transitions. Word has length 114 [2019-12-07 11:32:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:55,794 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 645 transitions. [2019-12-07 11:32:55,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 645 transitions. [2019-12-07 11:32:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 11:32:55,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:55,795 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:55,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 11:32:55,996 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1356993869, now seen corresponding path program 1 times [2019-12-07 11:32:55,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:32:55,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399074563] [2019-12-07 11:32:55,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:56,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:32:56,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:56,153 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 11:32:56,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:56,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:56,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:56,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:32:56,162 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 11:32:56,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:56,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:56,164 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 11:32:56,164 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:32:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:32:56,178 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:32:56,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399074563] [2019-12-07 11:32:56,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:56,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:32:56,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942471085] [2019-12-07 11:32:56,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:56,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:32:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:56,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:56,203 INFO L87 Difference]: Start difference. First operand 421 states and 645 transitions. Second operand 6 states. [2019-12-07 11:33:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:02,511 INFO L93 Difference]: Finished difference Result 1001 states and 1526 transitions. [2019-12-07 11:33:02,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:02,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-12-07 11:33:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:02,514 INFO L225 Difference]: With dead ends: 1001 [2019-12-07 11:33:02,514 INFO L226 Difference]: Without dead ends: 599 [2019-12-07 11:33:02,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-07 11:33:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 449. [2019-12-07 11:33:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-07 11:33:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 682 transitions. [2019-12-07 11:33:02,526 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 682 transitions. Word has length 116 [2019-12-07 11:33:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:02,526 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 682 transitions. [2019-12-07 11:33:02,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 682 transitions. [2019-12-07 11:33:02,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 11:33:02,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:02,527 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:02,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 11:33:02,728 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:02,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1167990834, now seen corresponding path program 1 times [2019-12-07 11:33:02,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:02,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187675929] [2019-12-07 11:33:02,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:02,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:02,946 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:02,949 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 11:33:02,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:02,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:02,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:02,952 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:02,959 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 11:33:02,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:02,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:02,960 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 11:33:02,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:33:02,975 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 11:33:03,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187675929] [2019-12-07 11:33:03,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:03,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:03,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867170217] [2019-12-07 11:33:03,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:03,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:03,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:03,003 INFO L87 Difference]: Start difference. First operand 449 states and 682 transitions. Second operand 6 states. [2019-12-07 11:33:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:09,166 INFO L93 Difference]: Finished difference Result 1007 states and 1522 transitions. [2019-12-07 11:33:09,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:09,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-12-07 11:33:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:09,169 INFO L225 Difference]: With dead ends: 1007 [2019-12-07 11:33:09,169 INFO L226 Difference]: Without dead ends: 577 [2019-12-07 11:33:09,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-12-07 11:33:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 449. [2019-12-07 11:33:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-07 11:33:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 675 transitions. [2019-12-07 11:33:09,177 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 675 transitions. Word has length 117 [2019-12-07 11:33:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:09,178 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 675 transitions. [2019-12-07 11:33:09,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 675 transitions. [2019-12-07 11:33:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 11:33:09,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:09,179 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 11:33:09,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 11:33:09,379 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:09,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash 816861398, now seen corresponding path program 1 times [2019-12-07 11:33:09,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:09,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216704917] [2019-12-07 11:33:09,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:09,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:09,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:09,501 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 11:33:09,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:09,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:09,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:09,504 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:09,512 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 11:33:09,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:09,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:09,514 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 11:33:09,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:33:09,531 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:33:09,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216704917] [2019-12-07 11:33:09,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:09,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:09,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906398274] [2019-12-07 11:33:09,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:09,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:09,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:09,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:09,565 INFO L87 Difference]: Start difference. First operand 449 states and 675 transitions. Second operand 6 states. [2019-12-07 11:33:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:17,402 INFO L93 Difference]: Finished difference Result 1049 states and 1569 transitions. [2019-12-07 11:33:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:17,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-12-07 11:33:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:17,405 INFO L225 Difference]: With dead ends: 1049 [2019-12-07 11:33:17,405 INFO L226 Difference]: Without dead ends: 619 [2019-12-07 11:33:17,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-12-07 11:33:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 484. [2019-12-07 11:33:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 11:33:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 724 transitions. [2019-12-07 11:33:17,415 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 724 transitions. Word has length 123 [2019-12-07 11:33:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:17,416 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 724 transitions. [2019-12-07 11:33:17,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 724 transitions. [2019-12-07 11:33:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 11:33:17,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:17,417 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 11:33:17,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 11:33:17,618 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash -108509428, now seen corresponding path program 1 times [2019-12-07 11:33:17,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:17,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103614937] [2019-12-07 11:33:17,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:17,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:17,775 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:17,777 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 11:33:17,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:17,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:17,780 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:17,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:17,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 11:33:17,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:17,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:17,788 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 11:33:17,788 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:33:17,806 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 11:33:17,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103614937] [2019-12-07 11:33:17,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:17,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:17,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722732426] [2019-12-07 11:33:17,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:17,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:17,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:17,835 INFO L87 Difference]: Start difference. First operand 484 states and 724 transitions. Second operand 6 states. [2019-12-07 11:33:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:25,907 INFO L93 Difference]: Finished difference Result 1075 states and 1602 transitions. [2019-12-07 11:33:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:25,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-12-07 11:33:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:25,910 INFO L225 Difference]: With dead ends: 1075 [2019-12-07 11:33:25,910 INFO L226 Difference]: Without dead ends: 610 [2019-12-07 11:33:25,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-07 11:33:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 484. [2019-12-07 11:33:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 11:33:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 720 transitions. [2019-12-07 11:33:25,923 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 720 transitions. Word has length 124 [2019-12-07 11:33:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:25,923 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 720 transitions. [2019-12-07 11:33:25,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 720 transitions. [2019-12-07 11:33:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 11:33:25,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:25,924 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:33:26,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 11:33:26,125 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1177565895, now seen corresponding path program 1 times [2019-12-07 11:33:26,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:26,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326670578] [2019-12-07 11:33:26,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:26,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:26,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:26,260 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 11:33:26,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:26,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:26,263 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:26,263 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:26,270 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 11:33:26,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:26,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:26,272 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 11:33:26,272 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 11:33:26,293 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 11:33:26,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326670578] [2019-12-07 11:33:26,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:26,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:26,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026998558] [2019-12-07 11:33:26,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:26,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:26,333 INFO L87 Difference]: Start difference. First operand 484 states and 720 transitions. Second operand 6 states. [2019-12-07 11:33:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:34,220 INFO L93 Difference]: Finished difference Result 1118 states and 1654 transitions. [2019-12-07 11:33:34,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:34,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-12-07 11:33:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:34,223 INFO L225 Difference]: With dead ends: 1118 [2019-12-07 11:33:34,223 INFO L226 Difference]: Without dead ends: 653 [2019-12-07 11:33:34,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-07 11:33:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 527. [2019-12-07 11:33:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-07 11:33:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 779 transitions. [2019-12-07 11:33:34,232 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 779 transitions. Word has length 141 [2019-12-07 11:33:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:34,232 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 779 transitions. [2019-12-07 11:33:34,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:34,232 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 779 transitions. [2019-12-07 11:33:34,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 11:33:34,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:34,233 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:34,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 11:33:34,434 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1638419441, now seen corresponding path program 1 times [2019-12-07 11:33:34,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:34,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498929209] [2019-12-07 11:33:34,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:34,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:34,721 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:34,724 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 11:33:34,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:34,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:34,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:34,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:34,734 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 11:33:34,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:34,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:34,736 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 11:33:34,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 11:33:34,757 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 11:33:34,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498929209] [2019-12-07 11:33:34,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:34,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:34,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944513461] [2019-12-07 11:33:34,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:34,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:34,790 INFO L87 Difference]: Start difference. First operand 527 states and 779 transitions. Second operand 6 states. [2019-12-07 11:33:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:39,541 INFO L93 Difference]: Finished difference Result 1159 states and 1708 transitions. [2019-12-07 11:33:39,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:39,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-12-07 11:33:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:39,544 INFO L225 Difference]: With dead ends: 1159 [2019-12-07 11:33:39,544 INFO L226 Difference]: Without dead ends: 635 [2019-12-07 11:33:39,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-12-07 11:33:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 519. [2019-12-07 11:33:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-12-07 11:33:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 765 transitions. [2019-12-07 11:33:39,558 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 765 transitions. Word has length 142 [2019-12-07 11:33:39,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:39,558 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 765 transitions. [2019-12-07 11:33:39,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 765 transitions. [2019-12-07 11:33:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 11:33:39,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:39,560 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:39,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 11:33:39,761 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash 127108449, now seen corresponding path program 1 times [2019-12-07 11:33:39,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:39,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075907536] [2019-12-07 11:33:39,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:39,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:39,956 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:39,959 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 11:33:39,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:39,970 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:39,970 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:39,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:39,977 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 11:33:39,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:39,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:39,979 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 11:33:39,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 11:33:39,996 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 11:33:40,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075907536] [2019-12-07 11:33:40,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:40,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:40,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865607291] [2019-12-07 11:33:40,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:40,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:40,027 INFO L87 Difference]: Start difference. First operand 519 states and 765 transitions. Second operand 6 states. [2019-12-07 11:33:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:46,005 INFO L93 Difference]: Finished difference Result 1169 states and 1721 transitions. [2019-12-07 11:33:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:46,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-12-07 11:33:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:46,009 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 11:33:46,009 INFO L226 Difference]: Without dead ends: 669 [2019-12-07 11:33:46,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-07 11:33:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 545. [2019-12-07 11:33:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-12-07 11:33:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 795 transitions. [2019-12-07 11:33:46,019 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 795 transitions. Word has length 144 [2019-12-07 11:33:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:46,020 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 795 transitions. [2019-12-07 11:33:46,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 795 transitions. [2019-12-07 11:33:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 11:33:46,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:46,020 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 11:33:46,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 11:33:46,222 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash -49779866, now seen corresponding path program 1 times [2019-12-07 11:33:46,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:46,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117282522] [2019-12-07 11:33:46,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:46,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:46,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:46,407 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 11:33:46,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:46,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:46,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:46,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:46,416 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 11:33:46,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:46,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:46,418 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 11:33:46,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 11:33:46,436 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 11:33:46,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117282522] [2019-12-07 11:33:46,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:46,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:46,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872991296] [2019-12-07 11:33:46,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:46,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:46,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:46,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:46,466 INFO L87 Difference]: Start difference. First operand 545 states and 795 transitions. Second operand 6 states. [2019-12-07 11:33:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:52,980 INFO L93 Difference]: Finished difference Result 1185 states and 1727 transitions. [2019-12-07 11:33:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:33:52,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-12-07 11:33:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:52,983 INFO L225 Difference]: With dead ends: 1185 [2019-12-07 11:33:52,983 INFO L226 Difference]: Without dead ends: 659 [2019-12-07 11:33:52,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-12-07 11:33:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 545. [2019-12-07 11:33:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-12-07 11:33:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 785 transitions. [2019-12-07 11:33:52,993 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 785 transitions. Word has length 145 [2019-12-07 11:33:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:52,994 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 785 transitions. [2019-12-07 11:33:52,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:33:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 785 transitions. [2019-12-07 11:33:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 11:33:52,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:52,994 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:53,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 11:33:53,196 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1100606371, now seen corresponding path program 1 times [2019-12-07 11:33:53,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:33:53,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786768053] [2019-12-07 11:33:53,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:53,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:33:53,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:53,498 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 11:33:53,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:53,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:53,500 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:53,500 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:33:53,510 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 11:33:53,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:53,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:53,512 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 11:33:53,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:33:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 11:33:53,542 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 11:33:53,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786768053] [2019-12-07 11:33:53,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:53,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:33:53,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575568123] [2019-12-07 11:33:53,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:33:53,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:33:53,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:33:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:33:53,576 INFO L87 Difference]: Start difference. First operand 545 states and 785 transitions. Second operand 6 states. [2019-12-07 11:34:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:01,314 INFO L93 Difference]: Finished difference Result 1219 states and 1755 transitions. [2019-12-07 11:34:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:34:01,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-12-07 11:34:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:01,317 INFO L225 Difference]: With dead ends: 1219 [2019-12-07 11:34:01,317 INFO L226 Difference]: Without dead ends: 693 [2019-12-07 11:34:01,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:34:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-12-07 11:34:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 578. [2019-12-07 11:34:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-12-07 11:34:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 827 transitions. [2019-12-07 11:34:01,328 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 827 transitions. Word has length 155 [2019-12-07 11:34:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:01,328 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 827 transitions. [2019-12-07 11:34:01,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 827 transitions. [2019-12-07 11:34:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 11:34:01,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:01,329 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:01,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 11:34:01,530 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:01,531 INFO L82 PathProgramCache]: Analyzing trace with hash 103864115, now seen corresponding path program 1 times [2019-12-07 11:34:01,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:01,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923699955] [2019-12-07 11:34:01,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:01,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:34:01,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:01,729 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 11:34:01,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:01,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:01,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:01,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:34:01,740 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 11:34:01,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:01,741 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:01,742 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 11:34:01,742 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:34:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 11:34:01,763 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 11:34:01,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923699955] [2019-12-07 11:34:01,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:01,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:34:01,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666515776] [2019-12-07 11:34:01,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:34:01,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:34:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:34:01,800 INFO L87 Difference]: Start difference. First operand 578 states and 827 transitions. Second operand 6 states. [2019-12-07 11:34:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:08,638 INFO L93 Difference]: Finished difference Result 1247 states and 1784 transitions. [2019-12-07 11:34:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:34:08,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-12-07 11:34:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:08,642 INFO L225 Difference]: With dead ends: 1247 [2019-12-07 11:34:08,642 INFO L226 Difference]: Without dead ends: 670 [2019-12-07 11:34:08,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:34:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-07 11:34:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 569. [2019-12-07 11:34:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-12-07 11:34:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 807 transitions. [2019-12-07 11:34:08,653 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 807 transitions. Word has length 156 [2019-12-07 11:34:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:08,653 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 807 transitions. [2019-12-07 11:34:08,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 807 transitions. [2019-12-07 11:34:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 11:34:08,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:08,654 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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 11:34:08,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 11:34:08,855 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash -846499204, now seen corresponding path program 1 times [2019-12-07 11:34:08,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:08,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421244344] [2019-12-07 11:34:08,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:09,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:34:09,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:09,060 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 11:34:09,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:09,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:09,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:09,062 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:34:09,084 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 11:34:09,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:09,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:09,086 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 11:34:09,086 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:34:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 11:34:09,105 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 11:34:09,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421244344] [2019-12-07 11:34:09,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:09,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:34:09,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612702854] [2019-12-07 11:34:09,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:34:09,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:09,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:34:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:34:09,136 INFO L87 Difference]: Start difference. First operand 569 states and 807 transitions. Second operand 6 states. [2019-12-07 11:34:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:15,649 INFO L93 Difference]: Finished difference Result 1245 states and 1771 transitions. [2019-12-07 11:34:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:34:15,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-12-07 11:34:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:15,654 INFO L225 Difference]: With dead ends: 1245 [2019-12-07 11:34:15,654 INFO L226 Difference]: Without dead ends: 695 [2019-12-07 11:34:15,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:34:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-12-07 11:34:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 591. [2019-12-07 11:34:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-07 11:34:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 827 transitions. [2019-12-07 11:34:15,666 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 827 transitions. Word has length 163 [2019-12-07 11:34:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:15,666 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 827 transitions. [2019-12-07 11:34:15,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 827 transitions. [2019-12-07 11:34:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 11:34:15,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:15,667 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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 11:34:15,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 11:34:15,868 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash 160236311, now seen corresponding path program 1 times [2019-12-07 11:34:15,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:15,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030813584] [2019-12-07 11:34:15,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:16,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:34:16,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:16,015 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 11:34:16,015 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:16,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:16,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:16,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:34:16,028 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 11:34:16,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:16,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:16,030 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 11:34:16,030 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:34:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 11:34:16,050 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 11:34:16,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030813584] [2019-12-07 11:34:16,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:16,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:34:16,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75871991] [2019-12-07 11:34:16,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:34:16,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:34:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:34:16,082 INFO L87 Difference]: Start difference. First operand 591 states and 827 transitions. Second operand 6 states. [2019-12-07 11:34:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:20,248 INFO L93 Difference]: Finished difference Result 1260 states and 1767 transitions. [2019-12-07 11:34:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:34:20,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-12-07 11:34:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:20,252 INFO L225 Difference]: With dead ends: 1260 [2019-12-07 11:34:20,252 INFO L226 Difference]: Without dead ends: 688 [2019-12-07 11:34:20,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:34:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-12-07 11:34:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 591. [2019-12-07 11:34:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-07 11:34:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 815 transitions. [2019-12-07 11:34:20,264 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 815 transitions. Word has length 164 [2019-12-07 11:34:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:20,264 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 815 transitions. [2019-12-07 11:34:20,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 815 transitions. [2019-12-07 11:34:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 11:34:20,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:20,265 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:20,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 11:34:20,466 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash -554395830, now seen corresponding path program 1 times [2019-12-07 11:34:20,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:20,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918692440] [2019-12-07 11:34:20,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:20,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:34:20,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:20,693 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 11:34:20,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:20,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:20,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:20,697 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:34:20,704 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 11:34:20,704 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:20,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:20,706 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 11:34:20,706 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:34:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 11:34:20,725 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 11:34:20,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918692440] [2019-12-07 11:34:20,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:20,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:34:20,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530808453] [2019-12-07 11:34:20,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:34:20,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:34:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:34:20,757 INFO L87 Difference]: Start difference. First operand 591 states and 815 transitions. Second operand 6 states. [2019-12-07 11:34:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:28,127 INFO L93 Difference]: Finished difference Result 1285 states and 1777 transitions. [2019-12-07 11:34:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:34:28,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-12-07 11:34:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:28,131 INFO L225 Difference]: With dead ends: 1285 [2019-12-07 11:34:28,131 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 11:34:28,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:34:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 11:34:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 615. [2019-12-07 11:34:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-12-07 11:34:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 837 transitions. [2019-12-07 11:34:28,144 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 837 transitions. Word has length 166 [2019-12-07 11:34:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:28,144 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 837 transitions. [2019-12-07 11:34:28,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 837 transitions. [2019-12-07 11:34:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 11:34:28,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:28,145 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, 1, 1] [2019-12-07 11:34:28,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 11:34:28,346 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:28,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash -443861771, now seen corresponding path program 1 times [2019-12-07 11:34:28,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:28,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957897384] [2019-12-07 11:34:28,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:28,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:34:28,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 11:34:28,508 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-12-07 11:34:28,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957897384] [2019-12-07 11:34:28,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:28,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:34:28,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817893970] [2019-12-07 11:34:28,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:28,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:28,527 INFO L87 Difference]: Start difference. First operand 615 states and 837 transitions. Second operand 3 states. [2019-12-07 11:34:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:28,937 INFO L93 Difference]: Finished difference Result 1799 states and 2455 transitions. [2019-12-07 11:34:28,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:28,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 11:34:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:28,941 INFO L225 Difference]: With dead ends: 1799 [2019-12-07 11:34:28,941 INFO L226 Difference]: Without dead ends: 1203 [2019-12-07 11:34:28,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 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 11:34:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-07 11:34:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2019-12-07 11:34:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-07 11:34:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1630 transitions. [2019-12-07 11:34:28,966 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1630 transitions. Word has length 166 [2019-12-07 11:34:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:28,966 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1630 transitions. [2019-12-07 11:34:28,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1630 transitions. [2019-12-07 11:34:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 11:34:28,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:28,967 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:34:29,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 11:34:29,169 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1819906095, now seen corresponding path program 1 times [2019-12-07 11:34:29,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:29,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141531978] [2019-12-07 11:34:29,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:29,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:34:29,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:29,434 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 11:34:29,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:29,437 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:29,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:29,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 11:34:29,444 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 11:34:29,444 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:29,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:29,445 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 11:34:29,446 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 11:34:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 11:34:29,468 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 11:34:29,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141531978] [2019-12-07 11:34:29,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:29,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:34:29,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277533551] [2019-12-07 11:34:29,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:34:29,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:29,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:34:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:34:29,501 INFO L87 Difference]: Start difference. First operand 1203 states and 1630 transitions. Second operand 6 states. [2019-12-07 11:34:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:35,416 INFO L93 Difference]: Finished difference Result 2567 states and 3479 transitions. [2019-12-07 11:34:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:34:35,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-12-07 11:34:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:35,422 INFO L225 Difference]: With dead ends: 2567 [2019-12-07 11:34:35,422 INFO L226 Difference]: Without dead ends: 1367 [2019-12-07 11:34:35,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:34:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-12-07 11:34:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1195. [2019-12-07 11:34:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-12-07 11:34:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1594 transitions. [2019-12-07 11:34:35,449 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1594 transitions. Word has length 167 [2019-12-07 11:34:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:35,449 INFO L462 AbstractCegarLoop]: Abstraction has 1195 states and 1594 transitions. [2019-12-07 11:34:35,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:34:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1594 transitions. [2019-12-07 11:34:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 11:34:35,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:35,451 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, 1, 1, 1] [2019-12-07 11:34:35,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 11:34:35,652 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash -317547734, now seen corresponding path program 1 times [2019-12-07 11:34:35,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:35,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523667240] [2019-12-07 11:34:35,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:35,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:34:35,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:34:35,844 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 11:34:35,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523667240] [2019-12-07 11:34:35,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:35,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:34:35,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548628681] [2019-12-07 11:34:35,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:35,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:35,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:35,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:35,863 INFO L87 Difference]: Start difference. First operand 1195 states and 1594 transitions. Second operand 3 states. [2019-12-07 11:34:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:36,536 INFO L93 Difference]: Finished difference Result 2920 states and 3903 transitions. [2019-12-07 11:34:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:36,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 11:34:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:36,542 INFO L225 Difference]: With dead ends: 2920 [2019-12-07 11:34:36,542 INFO L226 Difference]: Without dead ends: 1744 [2019-12-07 11:34:36,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 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 11:34:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-12-07 11:34:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1742. [2019-12-07 11:34:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-12-07 11:34:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2321 transitions. [2019-12-07 11:34:36,587 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2321 transitions. Word has length 167 [2019-12-07 11:34:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:36,587 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 2321 transitions. [2019-12-07 11:34:36,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2321 transitions. [2019-12-07 11:34:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 11:34:36,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:36,588 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, 1, 1, 1, 1] [2019-12-07 11:34:36,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 11:34:36,790 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2001105334, now seen corresponding path program 1 times [2019-12-07 11:34:36,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:36,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625517591] [2019-12-07 11:34:36,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:37,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:34:37,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 11:34:37,131 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 11:34:37,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625517591] [2019-12-07 11:34:37,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:37,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:34:37,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817598562] [2019-12-07 11:34:37,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:37,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:37,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:37,158 INFO L87 Difference]: Start difference. First operand 1742 states and 2321 transitions. Second operand 3 states. [2019-12-07 11:34:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:38,273 INFO L93 Difference]: Finished difference Result 4005 states and 5350 transitions. [2019-12-07 11:34:38,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:38,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-12-07 11:34:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:38,280 INFO L225 Difference]: With dead ends: 4005 [2019-12-07 11:34:38,280 INFO L226 Difference]: Without dead ends: 2282 [2019-12-07 11:34:38,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 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 11:34:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-12-07 11:34:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2258. [2019-12-07 11:34:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-12-07 11:34:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3019 transitions. [2019-12-07 11:34:38,327 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3019 transitions. Word has length 168 [2019-12-07 11:34:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:38,327 INFO L462 AbstractCegarLoop]: Abstraction has 2258 states and 3019 transitions. [2019-12-07 11:34:38,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3019 transitions. [2019-12-07 11:34:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 11:34:38,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:38,329 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, 1, 1, 1, 1] [2019-12-07 11:34:38,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 11:34:38,529 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:38,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1053053368, now seen corresponding path program 1 times [2019-12-07 11:34:38,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:38,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000036916] [2019-12-07 11:34:38,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:38,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:34:38,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 11:34:38,681 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 11:34:38,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000036916] [2019-12-07 11:34:38,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:38,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:34:38,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441954485] [2019-12-07 11:34:38,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:38,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:38,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:38,697 INFO L87 Difference]: Start difference. First operand 2258 states and 3019 transitions. Second operand 3 states. [2019-12-07 11:34:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:40,171 INFO L93 Difference]: Finished difference Result 4546 states and 6083 transitions. [2019-12-07 11:34:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:40,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-12-07 11:34:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:40,179 INFO L225 Difference]: With dead ends: 4546 [2019-12-07 11:34:40,179 INFO L226 Difference]: Without dead ends: 2307 [2019-12-07 11:34:40,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 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 11:34:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-12-07 11:34:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-12-07 11:34:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-12-07 11:34:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3085 transitions. [2019-12-07 11:34:40,226 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3085 transitions. Word has length 168 [2019-12-07 11:34:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:40,227 INFO L462 AbstractCegarLoop]: Abstraction has 2307 states and 3085 transitions. [2019-12-07 11:34:40,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3085 transitions. [2019-12-07 11:34:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 11:34:40,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:40,228 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, 1, 1, 1, 1] [2019-12-07 11:34:40,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 11:34:40,429 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:40,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1438915770, now seen corresponding path program 1 times [2019-12-07 11:34:40,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:40,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957990945] [2019-12-07 11:34:40,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:40,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:34:40,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 11:34:40,620 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 11:34:40,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957990945] [2019-12-07 11:34:40,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:40,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:34:40,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051691343] [2019-12-07 11:34:40,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:34:40,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:34:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:34:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:34:40,635 INFO L87 Difference]: Start difference. First operand 2307 states and 3085 transitions. Second operand 3 states. [2019-12-07 11:34:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:40,691 INFO L93 Difference]: Finished difference Result 4619 states and 6180 transitions. [2019-12-07 11:34:40,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:34:40,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-12-07 11:34:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:40,697 INFO L225 Difference]: With dead ends: 4619 [2019-12-07 11:34:40,697 INFO L226 Difference]: Without dead ends: 2331 [2019-12-07 11:34:40,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 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 11:34:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2019-12-07 11:34:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2331. [2019-12-07 11:34:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2019-12-07 11:34:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 3117 transitions. [2019-12-07 11:34:40,746 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 3117 transitions. Word has length 168 [2019-12-07 11:34:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:40,746 INFO L462 AbstractCegarLoop]: Abstraction has 2331 states and 3117 transitions. [2019-12-07 11:34:40,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:34:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 3117 transitions. [2019-12-07 11:34:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 11:34:40,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:40,747 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:34:40,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 11:34:40,948 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2019-12-07 11:34:40,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:34:40,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827365738] [2019-12-07 11:34:40,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:41,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 11:34:41,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:41,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 11:34:41,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:41,832 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 11:34:41,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:41,833 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_354|], 2=[|v_#memory_$Pointer$.base_348|, |v_#memory_$Pointer$.base_347|]} [2019-12-07 11:34:41,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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 11:34:41,881 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:41,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:41,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:41,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 11:34:41,995 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 11:34:42,039 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,053 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 11:34:42,053 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 11:34:42,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,063 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 30 treesize of output 14 [2019-12-07 11:34:42,064 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,068 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,069 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:34:42,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,080 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 30 treesize of output 14 [2019-12-07 11:34:42,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:34:42,091 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 11:34:42,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,119 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 35 treesize of output 23 [2019-12-07 11:34:42,119 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,127 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 11:34:42,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,137 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 30 treesize of output 14 [2019-12-07 11:34:42,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,143 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:34:42,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,146 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 30 treesize of output 14 [2019-12-07 11:34:42,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,151 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 11:34:42,155 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 11:34:42,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,178 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 35 treesize of output 23 [2019-12-07 11:34:42,179 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,186 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 11:34:42,188 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_349|], 2=[|v_#memory_$Pointer$.base_361|]} [2019-12-07 11:34:42,191 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 49 treesize of output 37 [2019-12-07 11:34:42,191 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 11:34:42,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,230 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 11:34:42,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:42,232 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,247 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 11:34:42,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,248 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 11:34:42,251 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 11:34:42,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,280 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 35 treesize of output 23 [2019-12-07 11:34:42,280 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,289 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,289 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 11:34:42,292 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_350|], 2=[|v_#memory_$Pointer$.base_363|]} [2019-12-07 11:34:42,295 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 49 treesize of output 37 [2019-12-07 11:34:42,295 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 11:34:42,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:42,338 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 11:34:42,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:34:42,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:42,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:42,340 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 11:34:42,359 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 11:34:42,359 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:42,359 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 11:34:42,363 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_406|, |v_#memory_$Pointer$.offset_351|], 2=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.base_364|, |v_#memory_$Pointer$.base_352|], 6=[|v_#memory_$Pointer$.offset_348|, |v_#memory_$Pointer$.base_353|]} [2019-12-07 11:34:42,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:42,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 11:34:42,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:43,093 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 11:34:43,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:43,133 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 19 treesize of output 1 [2019-12-07 11:34:43,133 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:43,437 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 11:34:43,437 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:43,445 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 11:34:44,018 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 11:34:44,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:44,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:44,100 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 30 treesize of output 14 [2019-12-07 11:34:44,101 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:44,334 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 11:34:44,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:44,340 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:34:44,538 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 11:34:44,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:44,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:34:44,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 106 [2019-12-07 11:34:44,544 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:44,604 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:44,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:35:00,811 WARN L192 SmtUtils]: Spent 16.20 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 11:35:00,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:00,811 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 166 [2019-12-07 11:35:00,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:35:00,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:35:00,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:00,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:00,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:00,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:00,814 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 5 xjuncts. [2019-12-07 11:35:00,932 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-12-07 11:35:00,932 INFO L614 ElimStorePlain]: treesize reduction 744, result has 11.3 percent of original size [2019-12-07 11:35:00,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:35:00,933 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:53 [2019-12-07 11:35:00,960 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_352|, |v_#memory_$Pointer$.base_365|], 12=[|v_#memory_int_407|]} [2019-12-07 11:35:00,963 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 53 treesize of output 41 [2019-12-07 11:35:00,963 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 11:35:00,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:00,990 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 51 treesize of output 33 [2019-12-07 11:35:00,990 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 11:35:01,014 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:01,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:35:01,017 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 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 11:35:01,017 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:01,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:01,030 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:35:01,030 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:41 [2019-12-07 11:35:01,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 11:35:01,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:01,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:01,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:35:01,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 11:35:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 11:35:01,234 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:35:01,274 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.base_367|, |v_#memory_$Pointer$.offset_354|, |v_#memory_$Pointer$.base_352|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_348|, |v_#memory_$Pointer$.base_353|]} [2019-12-07 11:35:01,346 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 20 treesize of output 1 [2019-12-07 11:35:01,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:01,895 WARN L192 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 11:35:01,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:01,934 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 11:35:02,354 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 11:35:02,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:02,367 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 11:35:02,591 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 11:35:02,592 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:02,596 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 11:35:02,706 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-12-07 11:35:02,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:02,710 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:35:02,773 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:02,778 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 1884 treesize of output 1716 [2019-12-07 11:35:02,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:35:02,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:02,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:35:02,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:02,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:35:02,782 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-12-07 11:35:03,121 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-12-07 11:35:03,122 INFO L614 ElimStorePlain]: treesize reduction 3160, result has 6.3 percent of original size [2019-12-07 11:35:11,302 WARN L192 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 11:35:11,302 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:11,302 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 92 [2019-12-07 11:35:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:35:11,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:11,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:11,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:11,340 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 54 treesize of output 52 [2019-12-07 11:35:11,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:11,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:35:11,348 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_83], 1=[v_arrayElimCell_84]} [2019-12-07 11:35:11,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827365738] [2019-12-07 11:35:11,351 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6ba5f1e9 [2019-12-07 11:35:11,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1468897858] [2019-12-07 11:35:11,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:35:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:14,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 11:35:14,432 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6ba5f1e9 [2019-12-07 11:35:14,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790520019] [2019-12-07 11:35:14,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6060047c-e12a-40db-89a7-9b1ccaf094b4/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:35:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:14,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 11:35:14,750 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6ba5f1e9 [2019-12-07 11:35:14,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:14,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 11:35:14,751 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 11:35:14,751 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:35:15,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:35:15,422 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 11:35:15,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:35:15 BoogieIcfgContainer [2019-12-07 11:35:15,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:35:15,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:35:15,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:35:15,422 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:35:15,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:30:50" (3/4) ... [2019-12-07 11:35:15,425 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:35:15,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:35:15,425 INFO L168 Benchmark]: Toolchain (without parser) took 267543.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:15,426 INFO L168 Benchmark]: CDTParser took 0.13 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 11:35:15,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:15,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:15,426 INFO L168 Benchmark]: Boogie Preprocessor took 54.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:15,426 INFO L168 Benchmark]: RCFGBuilder took 2410.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:35:15,427 INFO L168 Benchmark]: TraceAbstraction took 264589.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.9 MB). Free memory was 988.7 MB in the beginning and 1.1 GB in the end (delta: -97.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:35:15,427 INFO L168 Benchmark]: Witness Printer took 2.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:35:15,428 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.13 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 419.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2410.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 264589.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 29.9 MB). Free memory was 988.7 MB in the beginning and 1.1 GB in the end (delta: -97.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1735]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [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 [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) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 [L1371] s->state = 8528 [L1372] s->init_num = 0 [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1376] EXPR s->s3 [L1376] EXPR (s->s3)->tmp.new_cipher [L1376] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1376] l = ((s->s3)->tmp.new_cipher)->algorithms [L1377] EXPR s->options [L1377] COND TRUE s->options & 2097152UL [L1378] EXPR s->s3 [L1378] (s->s3)->tmp.use_rsa_tmp = 1 [L1382] EXPR s->s3 [L1382] (s->s3)->tmp.use_rsa_tmp [L1382] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1400] ret = __VERIFIER_nondet_int() [L1401] COND FALSE !(ret <= 0) [L1418] s->state = 8544 [L1419] s->init_num = 0 [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1423] EXPR s->verify_mode [L1423] COND TRUE s->verify_mode & 1 [L1424] EXPR s->session [L1424] EXPR (s->session)->peer [L1424] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1434] EXPR s->s3 [L1434] EXPR (s->s3)->tmp.new_cipher [L1434] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1434] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1444] EXPR s->s3 [L1444] (s->s3)->tmp.cert_request = 1 [L1445] ret = __VERIFIER_nondet_int() [L1446] COND FALSE !(ret <= 0) [L1451] s->state = 8448 [L1452] EXPR s->s3 [L1452] (s->s3)->tmp.next_state = 8576 [L1453] s->init_num = 0 [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) [L1539] COND FALSE !(blastFlag == 7) [L1542] COND FALSE !(blastFlag == 10) [L1735] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 151 locations, 1 error locations. Result: UNKNOWN, OverallTime: 264.4s, OverallIterations: 38, TraceHistogramMax: 7, AutomataDifference: 204.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6236 SDtfs, 6138 SDslu, 14459 SDs, 0 SdLazy, 13017 SolverSat, 2109 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 193.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8760 GetRequests, 8561 SyntacticMatches, 8 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2331occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 3944 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 4386 NumberOfCodeBlocks, 4386 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8698 ConstructedInterpolants, 0 QuantifiedInterpolants, 2719146 SizeOfPredicates, 100 NumberOfNonLiveVariables, 10586 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 74 InterpolantComputations, 74 PerfectInterpolantSequences, 8530/8530 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...